./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccd6d122756047ddb1225c106ac06a6748e14c22 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:05:32,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:05:32,255 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:05:32,263 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:05:32,263 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:05:32,264 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:05:32,264 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:05:32,265 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:05:32,266 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:05:32,267 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:05:32,267 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:05:32,268 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:05:32,268 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:05:32,269 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:05:32,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:05:32,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:05:32,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:05:32,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:05:32,273 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:05:32,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:05:32,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:05:32,275 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:05:32,277 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:05:32,277 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:05:32,277 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:05:32,278 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:05:32,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:05:32,278 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:05:32,279 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:05:32,280 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:05:32,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:05:32,280 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:05:32,281 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:05:32,281 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:05:32,281 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:05:32,282 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:05:32,282 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 22:05:32,289 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:05:32,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:05:32,290 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:05:32,290 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:05:32,290 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 22:05:32,290 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 22:05:32,290 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 22:05:32,291 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 22:05:32,291 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 22:05:32,291 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 22:05:32,291 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 22:05:32,291 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 22:05:32,291 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 22:05:32,292 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:05:32,292 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:05:32,292 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:05:32,292 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:05:32,292 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:05:32,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:05:32,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:05:32,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:05:32,292 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:05:32,293 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:05:32,293 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:05:32,293 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:05:32,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:05:32,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:05:32,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:05:32,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:05:32,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:05:32,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:05:32,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:05:32,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:05:32,294 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 22:05:32,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:05:32,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:05:32,294 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 22:05:32,294 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2018-11-22 22:05:32,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:05:32,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:05:32,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:05:32,330 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:05:32,331 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:05:32,331 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 22:05:32,375 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan/data/cdce89ee9/0b632f5a14e5407598dc924b7dd86727/FLAG229ad799d [2018-11-22 22:05:32,785 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:05:32,786 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 22:05:32,794 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan/data/cdce89ee9/0b632f5a14e5407598dc924b7dd86727/FLAG229ad799d [2018-11-22 22:05:32,805 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan/data/cdce89ee9/0b632f5a14e5407598dc924b7dd86727 [2018-11-22 22:05:32,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:05:32,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:05:32,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:05:32,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:05:32,813 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:05:32,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:05:32" (1/1) ... [2018-11-22 22:05:32,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e223a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32, skipping insertion in model container [2018-11-22 22:05:32,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:05:32" (1/1) ... [2018-11-22 22:05:32,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:05:32,840 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:05:32,964 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:05:32,966 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:05:32,979 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:05:32,988 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:05:32,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32 WrapperNode [2018-11-22 22:05:32,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:05:32,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:05:32,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:05:32,989 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:05:32,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32" (1/1) ... [2018-11-22 22:05:32,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32" (1/1) ... [2018-11-22 22:05:33,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:05:33,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:05:33,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:05:33,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:05:33,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32" (1/1) ... [2018-11-22 22:05:33,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32" (1/1) ... [2018-11-22 22:05:33,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32" (1/1) ... [2018-11-22 22:05:33,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32" (1/1) ... [2018-11-22 22:05:33,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32" (1/1) ... [2018-11-22 22:05:33,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32" (1/1) ... [2018-11-22 22:05:33,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32" (1/1) ... [2018-11-22 22:05:33,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:05:33,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:05:33,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:05:33,014 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:05:33,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:05:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:05:33,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:05:33,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:05:33,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:05:33,083 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:05:33,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:05:33,238 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:05:33,238 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 22:05:33,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:05:33 BoogieIcfgContainer [2018-11-22 22:05:33,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:05:33,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:05:33,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:05:33,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:05:33,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:05:32" (1/3) ... [2018-11-22 22:05:33,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21abc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:05:33, skipping insertion in model container [2018-11-22 22:05:33,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:05:32" (2/3) ... [2018-11-22 22:05:33,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21abc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:05:33, skipping insertion in model container [2018-11-22 22:05:33,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:05:33" (3/3) ... [2018-11-22 22:05:33,245 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 22:05:33,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:05:33,258 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 22:05:33,270 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 22:05:33,294 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:05:33,294 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:05:33,295 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:05:33,295 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:05:33,295 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:05:33,295 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:05:33,295 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:05:33,295 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:05:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-22 22:05:33,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 22:05:33,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:33,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:33,317 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:33,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:33,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2018-11-22 22:05:33,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:33,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:33,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:33,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:33,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:33,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:33,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:33,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:33,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,451 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2018-11-22 22:05:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:33,481 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2018-11-22 22:05:33,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:33,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-22 22:05:33,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:33,489 INFO L225 Difference]: With dead ends: 69 [2018-11-22 22:05:33,489 INFO L226 Difference]: Without dead ends: 54 [2018-11-22 22:05:33,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-22 22:05:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-11-22 22:05:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-22 22:05:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2018-11-22 22:05:33,518 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2018-11-22 22:05:33,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:33,518 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2018-11-22 22:05:33,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2018-11-22 22:05:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 22:05:33,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:33,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:33,519 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:33,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2018-11-22 22:05:33,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:33,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:33,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:33,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:33,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:33,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:33,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:33,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:33,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,565 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2018-11-22 22:05:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:33,581 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2018-11-22 22:05:33,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:33,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-22 22:05:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:33,582 INFO L225 Difference]: With dead ends: 87 [2018-11-22 22:05:33,582 INFO L226 Difference]: Without dead ends: 54 [2018-11-22 22:05:33,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-22 22:05:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-22 22:05:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-22 22:05:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2018-11-22 22:05:33,586 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2018-11-22 22:05:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:33,587 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2018-11-22 22:05:33,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2018-11-22 22:05:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 22:05:33,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:33,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:33,587 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:33,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:33,588 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2018-11-22 22:05:33,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:33,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:33,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:33,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:33,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:33,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:33,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:33,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:33,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,623 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2018-11-22 22:05:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:33,647 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2018-11-22 22:05:33,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:33,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-22 22:05:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:33,649 INFO L225 Difference]: With dead ends: 81 [2018-11-22 22:05:33,649 INFO L226 Difference]: Without dead ends: 57 [2018-11-22 22:05:33,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-22 22:05:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-22 22:05:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-22 22:05:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2018-11-22 22:05:33,656 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2018-11-22 22:05:33,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:33,656 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2018-11-22 22:05:33,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2018-11-22 22:05:33,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 22:05:33,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:33,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:33,658 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:33,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2018-11-22 22:05:33,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:33,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:33,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:33,681 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:33,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:33,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:33,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,682 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2018-11-22 22:05:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:33,696 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2018-11-22 22:05:33,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:33,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-22 22:05:33,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:33,697 INFO L225 Difference]: With dead ends: 100 [2018-11-22 22:05:33,697 INFO L226 Difference]: Without dead ends: 98 [2018-11-22 22:05:33,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-22 22:05:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2018-11-22 22:05:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-22 22:05:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2018-11-22 22:05:33,702 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2018-11-22 22:05:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:33,702 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2018-11-22 22:05:33,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2018-11-22 22:05:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 22:05:33,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:33,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:33,703 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:33,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:33,704 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2018-11-22 22:05:33,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:33,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:33,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:33,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:33,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:33,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:33,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:33,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,738 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2018-11-22 22:05:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:33,753 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2018-11-22 22:05:33,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:33,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-22 22:05:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:33,755 INFO L225 Difference]: With dead ends: 164 [2018-11-22 22:05:33,755 INFO L226 Difference]: Without dead ends: 100 [2018-11-22 22:05:33,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-22 22:05:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-22 22:05:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-22 22:05:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2018-11-22 22:05:33,762 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2018-11-22 22:05:33,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:33,762 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2018-11-22 22:05:33,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2018-11-22 22:05:33,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 22:05:33,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:33,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:33,764 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:33,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:33,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2018-11-22 22:05:33,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:33,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:33,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:33,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:33,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:33,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:33,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:33,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,784 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2018-11-22 22:05:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:33,802 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2018-11-22 22:05:33,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:33,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-22 22:05:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:33,803 INFO L225 Difference]: With dead ends: 147 [2018-11-22 22:05:33,803 INFO L226 Difference]: Without dead ends: 102 [2018-11-22 22:05:33,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-22 22:05:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-22 22:05:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-22 22:05:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2018-11-22 22:05:33,809 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2018-11-22 22:05:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:33,809 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2018-11-22 22:05:33,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2018-11-22 22:05:33,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 22:05:33,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:33,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:33,811 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:33,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:33,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2018-11-22 22:05:33,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:33,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:33,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:33,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:33,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:33,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:33,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:33,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:33,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:33,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,839 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2018-11-22 22:05:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:33,857 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2018-11-22 22:05:33,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:33,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-22 22:05:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:33,858 INFO L225 Difference]: With dead ends: 180 [2018-11-22 22:05:33,858 INFO L226 Difference]: Without dead ends: 178 [2018-11-22 22:05:33,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-22 22:05:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2018-11-22 22:05:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-22 22:05:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2018-11-22 22:05:33,867 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2018-11-22 22:05:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:33,867 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2018-11-22 22:05:33,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2018-11-22 22:05:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 22:05:33,868 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:33,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:33,869 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:33,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2018-11-22 22:05:33,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:33,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:33,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:33,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:33,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:33,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:33,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:33,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:33,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,893 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2018-11-22 22:05:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:33,910 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-11-22 22:05:33,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:33,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-22 22:05:33,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:33,911 INFO L225 Difference]: With dead ends: 312 [2018-11-22 22:05:33,911 INFO L226 Difference]: Without dead ends: 186 [2018-11-22 22:05:33,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-22 22:05:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-11-22 22:05:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-22 22:05:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2018-11-22 22:05:33,917 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2018-11-22 22:05:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:33,918 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2018-11-22 22:05:33,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2018-11-22 22:05:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 22:05:33,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:33,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:33,919 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:33,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:33,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2018-11-22 22:05:33,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:33,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:33,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:33,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:33,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:33,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:33,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:33,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:33,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,943 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2018-11-22 22:05:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:33,973 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2018-11-22 22:05:33,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:33,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-22 22:05:33,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:33,974 INFO L225 Difference]: With dead ends: 276 [2018-11-22 22:05:33,975 INFO L226 Difference]: Without dead ends: 190 [2018-11-22 22:05:33,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-22 22:05:33,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-11-22 22:05:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-22 22:05:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2018-11-22 22:05:33,984 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2018-11-22 22:05:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:33,985 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2018-11-22 22:05:33,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2018-11-22 22:05:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 22:05:33,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:33,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:33,986 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:33,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:33,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2018-11-22 22:05:33,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:33,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:33,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:33,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:34,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:34,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:34,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:34,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:34,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:34,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,006 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2018-11-22 22:05:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:34,025 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2018-11-22 22:05:34,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:34,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-22 22:05:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:34,027 INFO L225 Difference]: With dead ends: 332 [2018-11-22 22:05:34,028 INFO L226 Difference]: Without dead ends: 330 [2018-11-22 22:05:34,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-22 22:05:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2018-11-22 22:05:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-22 22:05:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2018-11-22 22:05:34,042 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2018-11-22 22:05:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:34,042 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2018-11-22 22:05:34,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2018-11-22 22:05:34,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 22:05:34,043 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:34,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:34,044 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:34,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:34,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2018-11-22 22:05:34,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:34,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:34,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:34,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:34,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:34,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:34,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,059 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2018-11-22 22:05:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:34,076 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2018-11-22 22:05:34,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:34,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-22 22:05:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:34,078 INFO L225 Difference]: With dead ends: 604 [2018-11-22 22:05:34,078 INFO L226 Difference]: Without dead ends: 354 [2018-11-22 22:05:34,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-22 22:05:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-11-22 22:05:34,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-22 22:05:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2018-11-22 22:05:34,089 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2018-11-22 22:05:34,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:34,089 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2018-11-22 22:05:34,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2018-11-22 22:05:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 22:05:34,090 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:34,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:34,091 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:34,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:34,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2018-11-22 22:05:34,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:34,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:34,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:34,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:34,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:34,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:34,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:34,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:34,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,111 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2018-11-22 22:05:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:34,130 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2018-11-22 22:05:34,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:34,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-22 22:05:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:34,131 INFO L225 Difference]: With dead ends: 528 [2018-11-22 22:05:34,131 INFO L226 Difference]: Without dead ends: 362 [2018-11-22 22:05:34,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-22 22:05:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2018-11-22 22:05:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-22 22:05:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2018-11-22 22:05:34,143 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2018-11-22 22:05:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:34,144 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2018-11-22 22:05:34,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2018-11-22 22:05:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 22:05:34,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:34,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:34,146 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:34,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:34,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2018-11-22 22:05:34,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:34,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:34,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:34,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:34,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:34,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:34,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:34,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:34,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,161 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2018-11-22 22:05:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:34,182 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2018-11-22 22:05:34,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:34,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-22 22:05:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:34,184 INFO L225 Difference]: With dead ends: 620 [2018-11-22 22:05:34,184 INFO L226 Difference]: Without dead ends: 618 [2018-11-22 22:05:34,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-22 22:05:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2018-11-22 22:05:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-22 22:05:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2018-11-22 22:05:34,200 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2018-11-22 22:05:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:34,201 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2018-11-22 22:05:34,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2018-11-22 22:05:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 22:05:34,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:34,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:34,202 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:34,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:34,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2018-11-22 22:05:34,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:34,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:34,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:34,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:34,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:34,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:34,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:34,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:34,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,220 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2018-11-22 22:05:34,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:34,259 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2018-11-22 22:05:34,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:34,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-22 22:05:34,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:34,261 INFO L225 Difference]: With dead ends: 1180 [2018-11-22 22:05:34,261 INFO L226 Difference]: Without dead ends: 682 [2018-11-22 22:05:34,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-11-22 22:05:34,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2018-11-22 22:05:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-11-22 22:05:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2018-11-22 22:05:34,287 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2018-11-22 22:05:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:34,288 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2018-11-22 22:05:34,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2018-11-22 22:05:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-22 22:05:34,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:34,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:34,289 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:34,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:34,290 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2018-11-22 22:05:34,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:34,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:34,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:34,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:34,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:34,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:34,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:34,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:34,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,312 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2018-11-22 22:05:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:34,343 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2018-11-22 22:05:34,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:34,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-22 22:05:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:34,346 INFO L225 Difference]: With dead ends: 1020 [2018-11-22 22:05:34,346 INFO L226 Difference]: Without dead ends: 698 [2018-11-22 22:05:34,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-11-22 22:05:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-11-22 22:05:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-11-22 22:05:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2018-11-22 22:05:34,371 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2018-11-22 22:05:34,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:34,371 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2018-11-22 22:05:34,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:34,371 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2018-11-22 22:05:34,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-22 22:05:34,372 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:34,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:34,372 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:34,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2018-11-22 22:05:34,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:34,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:34,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:34,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:34,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:34,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:34,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:34,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:34,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,387 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2018-11-22 22:05:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:34,420 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2018-11-22 22:05:34,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:34,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-22 22:05:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:34,423 INFO L225 Difference]: With dead ends: 1164 [2018-11-22 22:05:34,423 INFO L226 Difference]: Without dead ends: 1162 [2018-11-22 22:05:34,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-11-22 22:05:34,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2018-11-22 22:05:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-22 22:05:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2018-11-22 22:05:34,456 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2018-11-22 22:05:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:34,456 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2018-11-22 22:05:34,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2018-11-22 22:05:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-22 22:05:34,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:34,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:34,458 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:34,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:34,459 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2018-11-22 22:05:34,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:34,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:34,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:34,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:34,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:34,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:34,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:34,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:34,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,474 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2018-11-22 22:05:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:34,518 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2018-11-22 22:05:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:34,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-22 22:05:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:34,522 INFO L225 Difference]: With dead ends: 2316 [2018-11-22 22:05:34,522 INFO L226 Difference]: Without dead ends: 1322 [2018-11-22 22:05:34,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2018-11-22 22:05:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2018-11-22 22:05:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2018-11-22 22:05:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2018-11-22 22:05:34,571 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2018-11-22 22:05:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:34,571 INFO L480 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2018-11-22 22:05:34,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2018-11-22 22:05:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 22:05:34,573 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:34,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:34,573 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:34,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:34,574 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2018-11-22 22:05:34,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:34,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:34,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:34,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:34,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:34,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:34,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,591 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2018-11-22 22:05:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:34,632 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2018-11-22 22:05:34,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:34,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-22 22:05:34,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:34,636 INFO L225 Difference]: With dead ends: 1980 [2018-11-22 22:05:34,636 INFO L226 Difference]: Without dead ends: 1354 [2018-11-22 22:05:34,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-22 22:05:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-11-22 22:05:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-22 22:05:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2018-11-22 22:05:34,695 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2018-11-22 22:05:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:34,695 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2018-11-22 22:05:34,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2018-11-22 22:05:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 22:05:34,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:34,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:34,697 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:34,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:34,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2018-11-22 22:05:34,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:34,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:34,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:34,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:34,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:34,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:34,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:34,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:34,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,714 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2018-11-22 22:05:34,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:34,769 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2018-11-22 22:05:34,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:34,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-22 22:05:34,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:34,774 INFO L225 Difference]: With dead ends: 2186 [2018-11-22 22:05:34,775 INFO L226 Difference]: Without dead ends: 2184 [2018-11-22 22:05:34,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2018-11-22 22:05:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2018-11-22 22:05:34,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-11-22 22:05:34,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2018-11-22 22:05:34,832 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2018-11-22 22:05:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:34,832 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2018-11-22 22:05:34,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2018-11-22 22:05:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 22:05:34,835 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:05:34,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:05:34,835 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:05:34,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:05:34,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2018-11-22 22:05:34,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:05:34,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:05:34,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:05:34,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:05:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:05:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:05:34,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:05:34,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:05:34,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:05:34,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:05:34,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:05:34,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,855 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2018-11-22 22:05:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:05:34,934 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2018-11-22 22:05:34,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:05:34,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-22 22:05:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:05:34,935 INFO L225 Difference]: With dead ends: 4552 [2018-11-22 22:05:34,935 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 22:05:34,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:05:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 22:05:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 22:05:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 22:05:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 22:05:34,941 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-11-22 22:05:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:05:34,941 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:05:34,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:05:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:05:34,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 22:05:34,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 22:05:34,964 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-22 22:05:34,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 22:05:34,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 22:05:34,964 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 22:05:34,964 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 22:05:34,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 22:05:34,964 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2018-11-22 22:05:34,964 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-22 22:05:34,964 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,964 INFO L451 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2018-11-22 22:05:34,964 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-22 22:05:34,965 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-22 22:05:34,965 INFO L444 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2018-11-22 22:05:34,965 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2018-11-22 22:05:34,965 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,965 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,965 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,965 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2018-11-22 22:05:34,965 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2018-11-22 22:05:34,965 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,965 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-22 22:05:34,965 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,965 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,965 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2018-11-22 22:05:34,965 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-22 22:05:34,966 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-22 22:05:34,966 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,966 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,966 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,966 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-22 22:05:34,966 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,966 INFO L451 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2018-11-22 22:05:34,966 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2018-11-22 22:05:34,966 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,966 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2018-11-22 22:05:34,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:05:34 BoogieIcfgContainer [2018-11-22 22:05:34,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:05:34,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:05:34,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:05:34,974 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:05:34,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:05:33" (3/4) ... [2018-11-22 22:05:34,977 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 22:05:34,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 22:05:34,983 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 22:05:34,987 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-22 22:05:34,987 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-22 22:05:34,987 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 22:05:35,028 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_845de3ad-8574-4cce-8814-b9a8aff8b34b/bin-2019/utaipan/witness.graphml [2018-11-22 22:05:35,028 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:05:35,029 INFO L168 Benchmark]: Toolchain (without parser) took 2220.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 960.8 MB in the beginning and 1.0 GB in the end (delta: -69.9 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:05:35,030 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:05:35,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 950.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:05:35,030 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.67 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 944.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:05:35,031 INFO L168 Benchmark]: Boogie Preprocessor took 13.17 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:05:35,031 INFO L168 Benchmark]: RCFGBuilder took 225.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:05:35,031 INFO L168 Benchmark]: TraceAbstraction took 1733.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:05:35,031 INFO L168 Benchmark]: Witness Printer took 54.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:05:35,033 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.58 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 950.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.67 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 944.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.17 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 225.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1733.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.4 MB). Peak memory consumption was 75.4 MB. Max. memory is 11.5 GB. * Witness Printer took 54.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. SAFE Result, 1.6s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...