./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/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 35d30cdccac93bddd26c3755048a0b29ad39c8fa .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/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 35d30cdccac93bddd26c3755048a0b29ad39c8fa ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:54:43,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:54:43,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:54:43,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:54:43,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:54:43,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:54:43,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:54:43,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:54:43,591 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:54:43,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:54:43,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:54:43,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:54:43,593 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:54:43,593 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:54:43,594 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:54:43,595 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:54:43,595 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:54:43,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:54:43,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:54:43,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:54:43,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:54:43,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:54:43,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:54:43,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:54:43,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:54:43,611 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:54:43,612 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:54:43,612 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:54:43,613 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:54:43,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:54:43,614 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:54:43,617 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:54:43,618 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:54:43,618 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:54:43,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:54:43,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:54:43,619 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 22:54:43,633 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:54:43,633 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:54:43,634 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:54:43,635 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:54:43,635 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:54:43,635 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:54:43,635 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 22:54:43,636 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:54:43,636 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 22:54:43,637 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 22:54:43,637 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:54:43,637 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:54:43,637 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:54:43,638 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:54:43,638 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:54:43,638 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:54:43,638 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:54:43,638 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:54:43,638 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:54:43,638 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:54:43,639 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:54:43,639 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:54:43,639 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:54:43,639 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:54:43,639 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:54:43,639 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:54:43,639 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:54:43,640 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:54:43,640 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:54:43,640 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:54:43,640 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 22:54:43,640 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:54:43,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:54:43,640 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 22:54:43,641 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_d9c0ef58-f946-4f6e-b38b-4a38074c591b/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 -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2018-10-26 22:54:43,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:54:43,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:54:43,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:54:43,688 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:54:43,688 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:54:43,689 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-10-26 22:54:43,737 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/data/08565c191/be98145a98a448d18c6c012d9c2b261d/FLAG205c313d3 [2018-10-26 22:54:44,119 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:54:44,120 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-10-26 22:54:44,125 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/data/08565c191/be98145a98a448d18c6c012d9c2b261d/FLAG205c313d3 [2018-10-26 22:54:44,137 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/data/08565c191/be98145a98a448d18c6c012d9c2b261d [2018-10-26 22:54:44,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:54:44,143 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:54:44,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:54:44,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:54:44,147 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:54:44,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:54:44" (1/1) ... [2018-10-26 22:54:44,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a32240b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44, skipping insertion in model container [2018-10-26 22:54:44,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:54:44" (1/1) ... [2018-10-26 22:54:44,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:54:44,173 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:54:44,292 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:54:44,297 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:54:44,314 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:54:44,332 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:54:44,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44 WrapperNode [2018-10-26 22:54:44,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:54:44,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:54:44,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:54:44,333 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:54:44,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44" (1/1) ... [2018-10-26 22:54:44,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44" (1/1) ... [2018-10-26 22:54:44,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:54:44,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:54:44,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:54:44,371 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:54:44,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44" (1/1) ... [2018-10-26 22:54:44,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44" (1/1) ... [2018-10-26 22:54:44,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44" (1/1) ... [2018-10-26 22:54:44,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44" (1/1) ... [2018-10-26 22:54:44,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44" (1/1) ... [2018-10-26 22:54:44,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44" (1/1) ... [2018-10-26 22:54:44,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44" (1/1) ... [2018-10-26 22:54:44,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:54:44,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:54:44,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:54:44,406 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:54:44,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/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-10-26 22:54:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-10-26 22:54:44,532 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-10-26 22:54:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-26 22:54:44,532 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-10-26 22:54:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-10-26 22:54:44,532 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-10-26 22:54:44,532 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-10-26 22:54:44,532 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-10-26 22:54:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-10-26 22:54:44,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-10-26 22:54:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:54:44,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:54:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:54:44,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:54:44,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:54:44,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:54:45,048 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:54:45,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:54:45 BoogieIcfgContainer [2018-10-26 22:54:45,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:54:45,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:54:45,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:54:45,053 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:54:45,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:54:44" (1/3) ... [2018-10-26 22:54:45,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265fefd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:54:45, skipping insertion in model container [2018-10-26 22:54:45,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:54:44" (2/3) ... [2018-10-26 22:54:45,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265fefd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:54:45, skipping insertion in model container [2018-10-26 22:54:45,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:54:45" (3/3) ... [2018-10-26 22:54:45,057 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-10-26 22:54:45,067 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:54:45,074 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:54:45,093 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:54:45,120 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:54:45,121 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:54:45,121 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:54:45,121 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:54:45,121 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:54:45,121 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:54:45,121 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:54:45,121 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:54:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-10-26 22:54:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 22:54:45,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:54:45,145 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:54:45,147 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:54:45,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:45,153 INFO L82 PathProgramCache]: Analyzing trace with hash -914248174, now seen corresponding path program 1 times [2018-10-26 22:54:45,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:54:45,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:45,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:54:45,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:45,199 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:54:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:54:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:54:45,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:54:45,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:54:45,315 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:54:45,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:54:45,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:54:45,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:54:45,333 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-10-26 22:54:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:54:45,366 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2018-10-26 22:54:45,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:54:45,368 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2018-10-26 22:54:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:54:45,377 INFO L225 Difference]: With dead ends: 89 [2018-10-26 22:54:45,378 INFO L226 Difference]: Without dead ends: 44 [2018-10-26 22:54:45,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:54:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-26 22:54:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-26 22:54:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-26 22:54:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-10-26 22:54:45,421 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 40 [2018-10-26 22:54:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:54:45,421 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-10-26 22:54:45,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:54:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-10-26 22:54:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 22:54:45,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:54:45,424 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:54:45,424 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:54:45,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:45,425 INFO L82 PathProgramCache]: Analyzing trace with hash -622423070, now seen corresponding path program 1 times [2018-10-26 22:54:45,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:54:45,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:45,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:54:45,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:45,426 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:54:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:54:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:54:45,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:54:45,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:54:45,528 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:54:45,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:54:45,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:54:45,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:54:45,530 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-10-26 22:54:45,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:54:45,608 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-10-26 22:54:45,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:54:45,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-26 22:54:45,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:54:45,610 INFO L225 Difference]: With dead ends: 80 [2018-10-26 22:54:45,610 INFO L226 Difference]: Without dead ends: 47 [2018-10-26 22:54:45,611 INFO L605 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-10-26 22:54:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-26 22:54:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-26 22:54:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-26 22:54:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-10-26 22:54:45,620 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2018-10-26 22:54:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:54:45,620 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-10-26 22:54:45,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:54:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-10-26 22:54:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-26 22:54:45,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:54:45,621 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:54:45,622 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:54:45,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:45,622 INFO L82 PathProgramCache]: Analyzing trace with hash -485166222, now seen corresponding path program 1 times [2018-10-26 22:54:45,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:54:45,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:45,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:54:45,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:45,623 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:54:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:54:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 22:54:45,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:54:45,702 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:54:45,703 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-10-26 22:54:45,704 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [27], [40], [41], [45], [50], [53], [58], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-10-26 22:54:45,748 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:54:45,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:54:46,431 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 22:54:46,433 INFO L272 AbstractInterpreter]: Visited 27 different actions 49 times. Merged at 5 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 44 variables. [2018-10-26 22:54:46,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:46,476 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 22:54:46,721 INFO L227 lantSequenceWeakener]: Weakened 29 states. On average, predicates are now at 63.66% of their original sizes. [2018-10-26 22:54:46,723 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 22:54:47,743 INFO L415 sIntCurrentIteration]: We unified 45 AI predicates to 45 [2018-10-26 22:54:47,743 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 22:54:47,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:54:47,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [3] total 16 [2018-10-26 22:54:47,744 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:54:47,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 22:54:47,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 22:54:47,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:54:47,745 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 15 states. [2018-10-26 22:54:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:54:51,351 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-10-26 22:54:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 22:54:51,352 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-10-26 22:54:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:54:51,355 INFO L225 Difference]: With dead ends: 84 [2018-10-26 22:54:51,355 INFO L226 Difference]: Without dead ends: 62 [2018-10-26 22:54:51,356 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:54:51,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-26 22:54:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-10-26 22:54:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-26 22:54:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2018-10-26 22:54:51,371 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 46 [2018-10-26 22:54:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:54:51,372 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2018-10-26 22:54:51,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 22:54:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2018-10-26 22:54:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 22:54:51,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:54:51,373 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:54:51,373 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:54:51,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:51,373 INFO L82 PathProgramCache]: Analyzing trace with hash 861974448, now seen corresponding path program 1 times [2018-10-26 22:54:51,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:54:51,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:51,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:54:51,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:51,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:54:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:54:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 22:54:51,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:54:51,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:54:51,458 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:54:51,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:54:51,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:54:51,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:54:51,459 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 3 states. [2018-10-26 22:54:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:54:51,486 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-10-26 22:54:51,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:54:51,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-26 22:54:51,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:54:51,487 INFO L225 Difference]: With dead ends: 84 [2018-10-26 22:54:51,488 INFO L226 Difference]: Without dead ends: 68 [2018-10-26 22:54:51,488 INFO L605 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-10-26 22:54:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-26 22:54:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-10-26 22:54:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-26 22:54:51,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-10-26 22:54:51,502 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 47 [2018-10-26 22:54:51,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:54:51,502 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-10-26 22:54:51,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:54:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-10-26 22:54:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-26 22:54:51,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:54:51,503 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:54:51,504 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:54:51,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:51,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1897299478, now seen corresponding path program 1 times [2018-10-26 22:54:51,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:54:51,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:51,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:54:51,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:51,505 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:54:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:54:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:54:51,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:54:51,589 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:54:51,589 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-10-26 22:54:51,589 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [29], [32], [40], [41], [45], [50], [53], [58], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-10-26 22:54:51,592 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:54:51,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:54:51,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:54:51,999 INFO L272 AbstractInterpreter]: Visited 40 different actions 67 times. Merged at 5 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 51 variables. [2018-10-26 22:54:52,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:52,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:54:52,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:54:52,023 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:54:52,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:54:52,030 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:54:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:54:52,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:54:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:54:52,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:54:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:54:52,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:54:52,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2018-10-26 22:54:52,584 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:54:52,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:54:52,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:54:52,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:54:52,585 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 5 states. [2018-10-26 22:54:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:54:52,675 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2018-10-26 22:54:52,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:54:52,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-26 22:54:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:54:52,677 INFO L225 Difference]: With dead ends: 110 [2018-10-26 22:54:52,677 INFO L226 Difference]: Without dead ends: 63 [2018-10-26 22:54:52,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:54:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-26 22:54:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-26 22:54:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-26 22:54:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-10-26 22:54:52,691 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 48 [2018-10-26 22:54:52,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:54:52,691 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-10-26 22:54:52,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:54:52,691 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-10-26 22:54:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-26 22:54:52,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:54:52,692 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:54:52,693 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:54:52,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1740986502, now seen corresponding path program 2 times [2018-10-26 22:54:52,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:54:52,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:52,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:54:52,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:52,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:54:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:54:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:54:52,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:54:52,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 22:54:52,931 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:54:52,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 22:54:52,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 22:54:52,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:54:52,932 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 8 states. [2018-10-26 22:54:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:54:53,373 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2018-10-26 22:54:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 22:54:53,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-10-26 22:54:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:54:53,379 INFO L225 Difference]: With dead ends: 116 [2018-10-26 22:54:53,379 INFO L226 Difference]: Without dead ends: 103 [2018-10-26 22:54:53,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:54:53,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-26 22:54:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-10-26 22:54:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-26 22:54:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2018-10-26 22:54:53,413 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 51 [2018-10-26 22:54:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:54:53,413 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2018-10-26 22:54:53,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 22:54:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2018-10-26 22:54:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-26 22:54:53,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:54:53,414 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:54:53,415 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:54:53,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:53,415 INFO L82 PathProgramCache]: Analyzing trace with hash 211576461, now seen corresponding path program 1 times [2018-10-26 22:54:53,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:54:53,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:53,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:54:53,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:53,416 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:54:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:54:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:54:54,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:54:54,345 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:54:54,346 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-10-26 22:54:54,346 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [29], [32], [40], [41], [45], [50], [53], [58], [63], [65], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-10-26 22:54:54,348 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:54:54,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:54:55,017 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:54:55,018 INFO L272 AbstractInterpreter]: Visited 42 different actions 87 times. Merged at 11 different actions 30 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 51 variables. [2018-10-26 22:54:55,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:55,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:54:55,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:54:55,053 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:54:55,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:54:55,060 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:54:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:54:55,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:54:55,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:54:55,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:54:55,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:54:55,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:54:55,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:54:55,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-26 22:54:55,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:54:55,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 22:54:55,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:54:55,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:54:55,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:54:55,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-10-26 22:54:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 22:54:55,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:54:55,663 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-26 22:54:55,985 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-26 22:54:56,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-10-26 22:54:56,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-10-26 22:54:56,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:54:56,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:54:56,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:54:56,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-10-26 22:54:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 22:54:56,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:54:56,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 44 [2018-10-26 22:54:56,235 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:54:56,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-26 22:54:56,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-26 22:54:56,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1734, Unknown=0, NotChecked=0, Total=1892 [2018-10-26 22:54:56,236 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand 32 states. [2018-10-26 22:54:58,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:54:58,457 INFO L93 Difference]: Finished difference Result 243 states and 291 transitions. [2018-10-26 22:54:58,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-26 22:54:58,458 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2018-10-26 22:54:58,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:54:58,459 INFO L225 Difference]: With dead ends: 243 [2018-10-26 22:54:58,460 INFO L226 Difference]: Without dead ends: 207 [2018-10-26 22:54:58,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=707, Invalid=4843, Unknown=0, NotChecked=0, Total=5550 [2018-10-26 22:54:58,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-26 22:54:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 170. [2018-10-26 22:54:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-26 22:54:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 201 transitions. [2018-10-26 22:54:58,492 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 201 transitions. Word has length 55 [2018-10-26 22:54:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:54:58,492 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 201 transitions. [2018-10-26 22:54:58,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-26 22:54:58,493 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 201 transitions. [2018-10-26 22:54:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 22:54:58,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:54:58,496 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:54:58,496 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:54:58,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:58,496 INFO L82 PathProgramCache]: Analyzing trace with hash -833255376, now seen corresponding path program 1 times [2018-10-26 22:54:58,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:54:58,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:58,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:54:58,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:58,498 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:54:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:54:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:54:58,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:54:58,604 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:54:58,604 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-26 22:54:58,604 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [27], [29], [34], [36], [40], [41], [45], [50], [53], [58], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-10-26 22:54:58,606 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:54:58,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:54:59,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:54:59,353 INFO L272 AbstractInterpreter]: Visited 42 different actions 101 times. Merged at 11 different actions 40 times. Never widened. Found 7 fixpoints after 5 different actions. Largest state had 44 variables. [2018-10-26 22:54:59,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:59,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:54:59,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:54:59,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 22:54:59,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:54:59,417 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:54:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:54:59,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:54:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:54:59,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:54:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:54:59,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:54:59,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2018-10-26 22:54:59,742 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:54:59,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:54:59,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:54:59,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:54:59,743 INFO L87 Difference]: Start difference. First operand 170 states and 201 transitions. Second operand 5 states. [2018-10-26 22:54:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:54:59,914 INFO L93 Difference]: Finished difference Result 275 states and 328 transitions. [2018-10-26 22:54:59,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:54:59,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-10-26 22:54:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:54:59,920 INFO L225 Difference]: With dead ends: 275 [2018-10-26 22:54:59,921 INFO L226 Difference]: Without dead ends: 182 [2018-10-26 22:54:59,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:54:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-26 22:54:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-26 22:54:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-26 22:54:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 213 transitions. [2018-10-26 22:54:59,972 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 213 transitions. Word has length 57 [2018-10-26 22:54:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:54:59,973 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 213 transitions. [2018-10-26 22:54:59,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:54:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 213 transitions. [2018-10-26 22:54:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-26 22:54:59,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:54:59,976 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:54:59,976 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:54:59,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:54:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash -411043866, now seen corresponding path program 1 times [2018-10-26 22:54:59,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:54:59,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:59,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:54:59,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:54:59,977 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:55:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:00,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:00,131 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:55:00,132 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-10-26 22:55:00,132 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [29], [32], [34], [36], [40], [41], [45], [50], [53], [58], [63], [65], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-10-26 22:55:00,134 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:55:00,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:55:01,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:55:01,129 INFO L272 AbstractInterpreter]: Visited 44 different actions 123 times. Merged at 17 different actions 58 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 52 variables. [2018-10-26 22:55:01,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:01,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:55:01,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:01,139 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:55:01,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:55:01,145 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:55:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:01,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:55:01,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:55:01,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:55:01,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:01,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:01,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:55:01,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-10-26 22:55:01,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-10-26 22:55:01,347 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:55:01,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-10-26 22:55:01,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:01,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:01,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:01,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:3 [2018-10-26 22:55:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:01,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:55:01,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-26 22:55:01,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-10-26 22:55:01,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:01,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:01,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:01,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-10-26 22:55:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:01,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:55:01,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 12 [2018-10-26 22:55:01,517 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:55:01,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:55:01,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:55:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-10-26 22:55:01,518 INFO L87 Difference]: Start difference. First operand 182 states and 213 transitions. Second operand 11 states. [2018-10-26 22:55:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:55:01,855 INFO L93 Difference]: Finished difference Result 248 states and 301 transitions. [2018-10-26 22:55:01,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 22:55:01,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-10-26 22:55:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:55:01,856 INFO L225 Difference]: With dead ends: 248 [2018-10-26 22:55:01,856 INFO L226 Difference]: Without dead ends: 223 [2018-10-26 22:55:01,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 116 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-10-26 22:55:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-26 22:55:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 212. [2018-10-26 22:55:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-26 22:55:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 254 transitions. [2018-10-26 22:55:01,885 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 254 transitions. Word has length 59 [2018-10-26 22:55:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:55:01,885 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 254 transitions. [2018-10-26 22:55:01,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:55:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 254 transitions. [2018-10-26 22:55:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-26 22:55:01,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:55:01,888 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:55:01,888 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:55:01,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:01,888 INFO L82 PathProgramCache]: Analyzing trace with hash -26587930, now seen corresponding path program 1 times [2018-10-26 22:55:01,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:55:01,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:01,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:55:01,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:01,891 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:55:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:55:02,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:02,229 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:55:02,229 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-10-26 22:55:02,229 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [29], [32], [34], [36], [40], [41], [45], [50], [53], [58], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-10-26 22:55:02,232 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:55:02,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:55:03,237 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:55:03,237 INFO L272 AbstractInterpreter]: Visited 42 different actions 103 times. Merged at 11 different actions 44 times. Never widened. Found 9 fixpoints after 5 different actions. Largest state had 52 variables. [2018-10-26 22:55:03,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:03,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:55:03,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:03,287 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 22:55:03,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:55:03,306 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:55:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:03,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:55:04,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:55:04,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:55:04,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:04,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:04,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:04,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:55:04,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:55:04,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 22:55:04,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:04,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:04,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:04,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-10-26 22:55:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:55:04,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:55:04,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-26 22:55:04,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-10-26 22:55:04,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:04,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:55:04,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:55:04,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-10-26 22:55:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:55:05,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:55:05,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 48 [2018-10-26 22:55:05,003 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:55:05,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-26 22:55:05,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-26 22:55:05,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2082, Unknown=0, NotChecked=0, Total=2256 [2018-10-26 22:55:05,004 INFO L87 Difference]: Start difference. First operand 212 states and 254 transitions. Second operand 34 states. [2018-10-26 22:55:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:55:07,101 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2018-10-26 22:55:07,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 22:55:07,102 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 59 [2018-10-26 22:55:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:55:07,104 INFO L225 Difference]: With dead ends: 307 [2018-10-26 22:55:07,104 INFO L226 Difference]: Without dead ends: 269 [2018-10-26 22:55:07,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=483, Invalid=4073, Unknown=0, NotChecked=0, Total=4556 [2018-10-26 22:55:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-26 22:55:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 212. [2018-10-26 22:55:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-26 22:55:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2018-10-26 22:55:07,136 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 59 [2018-10-26 22:55:07,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:55:07,136 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2018-10-26 22:55:07,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-26 22:55:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2018-10-26 22:55:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-26 22:55:07,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:55:07,137 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:55:07,138 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:55:07,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:07,138 INFO L82 PathProgramCache]: Analyzing trace with hash -318623257, now seen corresponding path program 1 times [2018-10-26 22:55:07,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:55:07,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:07,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:55:07,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:07,141 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:55:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:07,772 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-10-26 22:55:07,853 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:07,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:07,853 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:55:07,853 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 63 with the following transitions: [2018-10-26 22:55:07,853 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [27], [29], [32], [34], [36], [40], [41], [45], [50], [53], [58], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-10-26 22:55:07,856 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:55:07,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:55:08,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:55:08,982 INFO L272 AbstractInterpreter]: Visited 43 different actions 119 times. Merged at 12 different actions 52 times. Never widened. Found 13 fixpoints after 5 different actions. Largest state had 52 variables. [2018-10-26 22:55:09,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:09,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:55:09,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:09,019 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 22:55:09,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:55:09,030 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:55:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:09,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:55:09,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:55:09,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:55:09,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-10-26 22:55:09,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:55:09,337 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:55:09,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:55:09,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-26 22:55:09,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:55:09,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:55:09,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-10-26 22:55:09,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:55:09,707 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:55:09,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:55:09,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-26 22:55:09,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:55:09,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:55:09,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-10-26 22:55:09,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 22:55:09,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:55:09,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:09,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-10-26 22:55:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 33 refuted. 2 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:55:09,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:55:10,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-26 22:55:10,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-10-26 22:55:10,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-10-26 22:55:10,234 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:10,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:10,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:10,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:10,237 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-10-26 22:55:10,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-10-26 22:55:10,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-26 22:55:10,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-10-26 22:55:10,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:10,394 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:55:10,395 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:55:10,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-10-26 22:55:10,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:10,403 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:55:10,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:55:10,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:55:10,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:27, output treesize:31 [2018-10-26 22:55:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:10,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:55:10,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 18] total 49 [2018-10-26 22:55:10,485 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:55:10,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-26 22:55:10,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-26 22:55:10,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2150, Unknown=17, NotChecked=0, Total=2352 [2018-10-26 22:55:10,487 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 33 states. [2018-10-26 22:55:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:55:12,740 INFO L93 Difference]: Finished difference Result 297 states and 362 transitions. [2018-10-26 22:55:12,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-26 22:55:12,741 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2018-10-26 22:55:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:55:12,742 INFO L225 Difference]: With dead ends: 297 [2018-10-26 22:55:12,742 INFO L226 Difference]: Without dead ends: 156 [2018-10-26 22:55:12,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=638, Invalid=5023, Unknown=39, NotChecked=0, Total=5700 [2018-10-26 22:55:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-26 22:55:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 141. [2018-10-26 22:55:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-26 22:55:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2018-10-26 22:55:12,757 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 62 [2018-10-26 22:55:12,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:55:12,757 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2018-10-26 22:55:12,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-26 22:55:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2018-10-26 22:55:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 22:55:12,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:55:12,758 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:55:12,759 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:55:12,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:12,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1083909650, now seen corresponding path program 1 times [2018-10-26 22:55:12,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:55:12,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:12,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:55:12,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:12,760 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:55:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:55:13,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:13,041 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:55:13,041 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-10-26 22:55:13,041 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [29], [32], [34], [36], [40], [41], [45], [50], [53], [56], [58], [61], [63], [65], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108] [2018-10-26 22:55:13,042 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:55:13,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:55:14,502 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:55:14,502 INFO L272 AbstractInterpreter]: Visited 46 different actions 129 times. Merged at 18 different actions 60 times. Never widened. Found 13 fixpoints after 7 different actions. Largest state had 52 variables. [2018-10-26 22:55:14,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:14,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:55:14,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:14,507 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:55:14,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:55:14,515 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:55:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:14,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:55:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:55:14,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:55:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:55:14,665 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:55:14,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 6 [2018-10-26 22:55:14,666 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 22:55:14,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:55:14,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:55:14,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:55:14,666 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand 5 states. [2018-10-26 22:55:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:55:14,756 INFO L93 Difference]: Finished difference Result 235 states and 281 transitions. [2018-10-26 22:55:14,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:55:14,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-10-26 22:55:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:55:14,759 INFO L225 Difference]: With dead ends: 235 [2018-10-26 22:55:14,759 INFO L226 Difference]: Without dead ends: 144 [2018-10-26 22:55:14,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:55:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-26 22:55:14,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-10-26 22:55:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-26 22:55:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2018-10-26 22:55:14,782 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 65 [2018-10-26 22:55:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:55:14,782 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2018-10-26 22:55:14,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:55:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2018-10-26 22:55:14,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-26 22:55:14,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:55:14,785 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:55:14,786 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:55:14,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash 592150880, now seen corresponding path program 1 times [2018-10-26 22:55:14,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:55:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:14,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:55:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:14,787 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:55:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-26 22:55:14,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:14,941 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:55:14,941 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-10-26 22:55:14,941 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [27], [29], [32], [34], [36], [40], [41], [45], [48], [50], [53], [56], [58], [61], [65], [69], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110] [2018-10-26 22:55:14,945 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:55:14,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:55:16,674 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:55:16,674 INFO L272 AbstractInterpreter]: Visited 50 different actions 187 times. Merged at 21 different actions 88 times. Never widened. Found 16 fixpoints after 7 different actions. Largest state had 52 variables. [2018-10-26 22:55:16,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:16,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:55:16,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:16,683 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:55:16,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:55:16,692 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:55:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:16,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:55:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-26 22:55:16,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:55:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-26 22:55:16,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:55:16,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2018-10-26 22:55:16,838 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:55:16,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 22:55:16,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 22:55:16,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:55:16,839 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand 5 states. [2018-10-26 22:55:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:55:16,865 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2018-10-26 22:55:16,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:55:16,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-10-26 22:55:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:55:16,867 INFO L225 Difference]: With dead ends: 171 [2018-10-26 22:55:16,867 INFO L226 Difference]: Without dead ends: 144 [2018-10-26 22:55:16,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:55:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-26 22:55:16,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-10-26 22:55:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-26 22:55:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-10-26 22:55:16,888 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 70 [2018-10-26 22:55:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:55:16,889 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-10-26 22:55:16,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 22:55:16,889 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-10-26 22:55:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-26 22:55:16,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:55:16,890 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:55:16,890 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:55:16,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:16,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1594544456, now seen corresponding path program 1 times [2018-10-26 22:55:16,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:55:16,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:16,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:55:16,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:16,895 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:55:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:17,347 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-26 22:55:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:55:17,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:17,817 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:55:17,817 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-10-26 22:55:17,817 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [29], [32], [34], [36], [40], [41], [45], [48], [50], [53], [56], [58], [61], [63], [65], [69], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110] [2018-10-26 22:55:17,820 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:55:17,820 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:55:19,232 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:55:19,232 INFO L272 AbstractInterpreter]: Visited 50 different actions 177 times. Merged at 20 different actions 80 times. Never widened. Found 18 fixpoints after 8 different actions. Largest state had 52 variables. [2018-10-26 22:55:19,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:19,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:55:19,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:19,271 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:55:19,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:55:19,282 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:55:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:19,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:55:19,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:55:19,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:55:19,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:19,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:19,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:19,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-26 22:55:19,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:55:19,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:55:19,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:19,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:19,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:19,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:55:19,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 22:55:19,907 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:55:19,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-26 22:55:19,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:19,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:19,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:19,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-10-26 22:55:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 22:55:19,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:55:20,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-10-26 22:55:20,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:55:20,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:20,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:20,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:20,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-10-26 22:55:20,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-26 22:55:20,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-10-26 22:55:20,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:20,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:55:20,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:20,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:4 [2018-10-26 22:55:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:55:20,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:55:20,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 19] total 60 [2018-10-26 22:55:20,667 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:55:20,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-26 22:55:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-26 22:55:20,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=3326, Unknown=0, NotChecked=0, Total=3540 [2018-10-26 22:55:20,669 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 43 states. [2018-10-26 22:55:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:55:24,701 INFO L93 Difference]: Finished difference Result 233 states and 251 transitions. [2018-10-26 22:55:24,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-26 22:55:24,701 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 71 [2018-10-26 22:55:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:55:24,702 INFO L225 Difference]: With dead ends: 233 [2018-10-26 22:55:24,702 INFO L226 Difference]: Without dead ends: 167 [2018-10-26 22:55:24,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=909, Invalid=9597, Unknown=0, NotChecked=0, Total=10506 [2018-10-26 22:55:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-26 22:55:24,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2018-10-26 22:55:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-26 22:55:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-10-26 22:55:24,723 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 71 [2018-10-26 22:55:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:55:24,724 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-10-26 22:55:24,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-26 22:55:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-10-26 22:55:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-26 22:55:24,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:55:24,724 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:55:24,725 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:55:24,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:24,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1227535224, now seen corresponding path program 2 times [2018-10-26 22:55:24,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:55:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:24,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:55:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:24,729 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:55:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:55:25,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:25,588 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:55:25,588 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:55:25,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:55:25,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:25,588 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:55:25,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:55:25,595 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 22:55:25,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 22:55:25,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:55:25,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:55:25,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:55:25,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:55:25,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:25,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:25,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:25,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-10-26 22:55:26,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:55:26,229 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:55:26,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2018-10-26 22:55:26,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:26,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:26,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:26,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:16 [2018-10-26 22:55:26,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 22:55:26,321 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:55:26,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-10-26 22:55:26,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:26,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:26,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:26,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2018-10-26 22:55:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-26 22:55:26,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:55:45,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-10-26 22:55:45,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-10-26 22:55:45,477 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 22:55:45,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:45,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-10-26 22:55:45,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:45,482 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:45,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:45,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:45,488 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:27, output treesize:3 [2018-10-26 22:55:45,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-10-26 22:55:45,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-26 22:55:45,619 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 22:55:45,620 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:45,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-10-26 22:55:45,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 22:55:45,633 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:55:45,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:55:45,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:55:45,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:34, output treesize:13 [2018-10-26 22:55:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-26 22:55:45,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:55:46,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 20] total 63 [2018-10-26 22:55:46,000 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:55:46,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-26 22:55:46,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-26 22:55:46,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3665, Unknown=28, NotChecked=0, Total=3906 [2018-10-26 22:55:46,001 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 45 states. [2018-10-26 22:55:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:55:56,921 INFO L93 Difference]: Finished difference Result 192 states and 195 transitions. [2018-10-26 22:55:56,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-26 22:55:56,922 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 71 [2018-10-26 22:55:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:55:56,923 INFO L225 Difference]: With dead ends: 192 [2018-10-26 22:55:56,923 INFO L226 Difference]: Without dead ends: 158 [2018-10-26 22:55:56,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4039 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=1889, Invalid=15317, Unknown=86, NotChecked=0, Total=17292 [2018-10-26 22:55:56,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-26 22:55:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 99. [2018-10-26 22:55:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-26 22:55:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-10-26 22:55:56,952 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 71 [2018-10-26 22:55:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:55:56,952 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-10-26 22:55:56,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-26 22:55:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-10-26 22:55:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-26 22:55:56,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:55:56,953 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:55:56,953 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:55:56,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:55:56,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1256785793, now seen corresponding path program 3 times [2018-10-26 22:55:56,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:55:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:56,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:55:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:55:56,959 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:55:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:55:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 22:55:57,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:57,406 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:55:57,406 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 22:55:57,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 22:55:57,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:55:57,407 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:55:57,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:55:57,414 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 22:55:57,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:55:57,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:55:57,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:55:57,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:55:57,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:55:57,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:57,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:57,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:57,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:55:57,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:55:57,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:55:57,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:57,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:57,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:57,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-10-26 22:55:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 28 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 22:55:57,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:55:58,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-26 22:55:58,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-10-26 22:55:58,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:58,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:58,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:55:58,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:9 [2018-10-26 22:55:58,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-26 22:55:58,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-10-26 22:55:58,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:55:58,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:55:58,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:55:58,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-10-26 22:55:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:55:58,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:55:58,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 22] total 58 [2018-10-26 22:55:58,641 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:55:58,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-26 22:55:58,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-26 22:55:58,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3093, Unknown=0, NotChecked=0, Total=3306 [2018-10-26 22:55:58,643 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 41 states. [2018-10-26 22:56:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:00,000 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-10-26 22:56:00,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-26 22:56:00,001 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 75 [2018-10-26 22:56:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:00,002 INFO L225 Difference]: With dead ends: 112 [2018-10-26 22:56:00,002 INFO L226 Difference]: Without dead ends: 79 [2018-10-26 22:56:00,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 118 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=477, Invalid=5843, Unknown=0, NotChecked=0, Total=6320 [2018-10-26 22:56:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-26 22:56:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-26 22:56:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-26 22:56:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-10-26 22:56:00,020 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 75 [2018-10-26 22:56:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:00,021 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-10-26 22:56:00,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-26 22:56:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-10-26 22:56:00,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-26 22:56:00,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:00,021 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:00,022 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:00,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash 132044873, now seen corresponding path program 1 times [2018-10-26 22:56:00,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 22:56:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:56:00,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:56:00,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:56:00,028 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 22:56:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 22:56:00,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:00,424 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 22:56:00,425 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 77 with the following transitions: [2018-10-26 22:56:00,425 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [9], [11], [15], [16], [17], [18], [19], [20], [24], [27], [29], [32], [34], [36], [40], [41], [45], [48], [50], [53], [58], [63], [65], [69], [70], [76], [79], [81], [85], [92], [94], [95], [96], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110] [2018-10-26 22:56:00,426 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 22:56:00,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 22:56:01,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 22:56:01,658 INFO L272 AbstractInterpreter]: Visited 49 different actions 181 times. Merged at 20 different actions 84 times. Never widened. Found 16 fixpoints after 7 different actions. Largest state had 52 variables. [2018-10-26 22:56:01,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:01,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 22:56:01,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:01,667 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:01,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:01,674 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 22:56:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:01,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:01,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:56:01,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:56:01,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:01,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:01,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:56:01,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:56:01,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:01,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:01,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:01,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-10-26 22:56:02,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:56:02,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 22:56:02,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:02,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:02,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:02,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-10-26 22:56:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 22:56:02,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:02,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-10-26 22:56:02,607 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 22:56:02,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:56:02,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:02,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:02,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-10-26 22:56:03,023 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 22:56:03,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:56:03,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:03,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:03,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:56:03,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:12 [2018-10-26 22:56:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 22:56:03,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:56:03,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 9] total 37 [2018-10-26 22:56:03,253 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 22:56:03,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-26 22:56:03,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-26 22:56:03,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2018-10-26 22:56:03,254 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 30 states. [2018-10-26 22:56:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:04,848 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-10-26 22:56:04,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 22:56:04,849 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 76 [2018-10-26 22:56:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:04,850 INFO L225 Difference]: With dead ends: 79 [2018-10-26 22:56:04,850 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 22:56:04,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=419, Invalid=2773, Unknown=0, NotChecked=0, Total=3192 [2018-10-26 22:56:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 22:56:04,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 22:56:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 22:56:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 22:56:04,851 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2018-10-26 22:56:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:04,851 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 22:56:04,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-26 22:56:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 22:56:04,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 22:56:04,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 22:56:04,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 22:56:04,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 22:56:04,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 22:56:06,392 WARN L179 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 144 DAG size of output: 63 [2018-10-26 22:56:06,749 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 88 [2018-10-26 22:56:06,858 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 58 [2018-10-26 22:56:07,312 WARN L179 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 114 [2018-10-26 22:56:07,481 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 83 [2018-10-26 22:56:07,589 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2018-10-26 22:56:07,851 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 91 [2018-10-26 22:56:08,316 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 84 [2018-10-26 22:56:08,574 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 88 [2018-10-26 22:56:08,895 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 72 [2018-10-26 22:56:09,142 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 86 [2018-10-26 22:56:09,807 WARN L179 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 85 [2018-10-26 22:56:10,060 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 76 [2018-10-26 22:56:10,159 INFO L421 ceAbstractionStarter]: At program point initENTRY(lines 15 21) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse0 .cse1) 0)) (< 1 (+ ~counter~0 |~#pp~0.offset|)) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_int| |old(#memory_int)|)) (not (= 0 (select .cse2 |~#pp~0.offset|))) (not (= (select .cse0 0) 0)) (< (+ ~counter~0 |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse2 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-10-26 22:56:10,160 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 20) no Hoare annotation was computed. [2018-10-26 22:56:10,160 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 20) no Hoare annotation was computed. [2018-10-26 22:56:10,160 INFO L421 ceAbstractionStarter]: At program point L17-4(lines 17 20) the Hoare annotation is: (let ((.cse3 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse4 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse0 .cse1)) (= 0 (select (select |#memory_int| |~#pstate~0.base|) (- (+ (- |~#pstate~0.offset|) (- 4))))) (= 0 (select .cse2 (+ |~#pp~0.offset| 4))) (= 0 (select .cse0 0)) (<= (* 2 init_~i~0) 4) (<= |~#pstate~0.offset| init_~i~0) (= 0 (select .cse2 |~#pp~0.offset|)))) (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse3 .cse1) 0)) (< 1 (+ ~counter~0 |~#pp~0.offset|)) (not (= 0 (select .cse4 |~#pp~0.offset|))) (not (= (select .cse3 0) 0)) (< (+ ~counter~0 |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse4 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-10-26 22:56:10,160 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 15 21) no Hoare annotation was computed. [2018-10-26 22:56:10,160 INFO L425 ceAbstractionStarter]: For program point L17-5(lines 15 21) no Hoare annotation was computed. [2018-10-26 22:56:10,160 INFO L425 ceAbstractionStarter]: For program point mallocFINAL(lines 46 49) no Hoare annotation was computed. [2018-10-26 22:56:10,160 INFO L425 ceAbstractionStarter]: For program point mallocEXIT(lines 46 49) no Hoare annotation was computed. [2018-10-26 22:56:10,160 INFO L421 ceAbstractionStarter]: At program point mallocENTRY(lines 46 49) the Hoare annotation is: (let ((.cse10 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse11 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse9 (+ |~#pstate~0.offset| 4))) (let ((.cse0 (= 0 |~#pp~0.base|)) (.cse1 (= 0 |~#pstate~0.base|)) (.cse2 (not (= (select .cse11 .cse9) 0))) (.cse3 (not (= 0 (select .cse10 |~#pp~0.offset|)))) (.cse4 (not (= (select .cse11 0) 0))) (.cse6 (not (= (select .cse10 .cse9) 0))) (.cse7 (< 8 (* 2 |malloc_#in~size|))) (.cse5 (select |#memory_int| |~#pstate~0.base|)) (.cse8 (< 0 (* 2 |~#pstate~0.offset|)))) (and (or (and (<= 2 (* 2 ~counter~0)) (<= (+ ~counter~0 |~#pstate~0.offset|) 1)) .cse0 .cse1 .cse2 (< |malloc_#in~size| (+ |old(~counter~0)| 3)) .cse3 .cse4 (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select .cse5 (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) .cse6 (< |malloc_#in~size| (+ |~#pp~0.offset| 4)) (< (* 2 |~#pp~0.offset|) 0) .cse7 .cse8) (or .cse0 .cse1 .cse2 (= ~counter~0 |old(~counter~0)|) .cse3 .cse4 .cse6 .cse7 (< (* 2 |old(~counter~0)|) 4) (< (+ |malloc_#in~size| |~#pstate~0.offset|) 4) (not (= (select .cse5 .cse9) 0)) (< (+ |~#pp~0.offset| 2) |old(~counter~0)|) (< 2 (+ |old(~counter~0)| |~#pp~0.offset|)) .cse8)))) [2018-10-26 22:56:10,160 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 22:56:10,161 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-10-26 22:56:10,161 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 22:56:10,161 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-10-26 22:56:10,161 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 25 31) no Hoare annotation was computed. [2018-10-26 22:56:10,161 INFO L425 ceAbstractionStarter]: For program point L25-3(lines 25 31) no Hoare annotation was computed. [2018-10-26 22:56:10,161 INFO L421 ceAbstractionStarter]: At program point L25-4(lines 25 31) the Hoare annotation is: (let ((.cse11 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse13 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse7 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse12 (+ |~#pstate~0.offset| 4))) (let ((.cse0 (not (= (select .cse7 .cse12) 0))) (.cse9 (not (= (select .cse13 .cse12) 0))) (.cse1 (select .cse13 |~#pp~0.offset|)) (.cse10 (not (= (select .cse11 .cse12) 0))) (.cse3 (= |f_#in~pointer.base| f_~pointer.base)) (.cse4 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse6 (= |#memory_int| |old(#memory_int)|)) (.cse5 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))) (and (let ((.cse8 (+ |f_#in~pointer.offset| |~#pp~0.offset|))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) .cse0 (not (= 0 .cse1)) (and .cse2 .cse3 .cse4 .cse5 (<= (* 2 f_~i~1) 0) .cse6 (<= 0 (+ |~#pp~0.offset| f_~i~1))) (not (= (select .cse7 0) 0)) (< .cse8 1) .cse9 (< |~#pp~0.offset| |f_#in~pointer.base|) (< 1 .cse8) (< 0 (+ |~#pp~0.offset| |f_#in~pointer.base|)) .cse10 (< (+ |~#pstate~0.offset| |f_#in~pointer.base|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) (or (< |f_#in~pointer.offset| .cse1) .cse0 (not (= 0 |~#pstate~0.offset|)) (and (= f_~pointer.base |f_#in~pointer.base|) .cse4 .cse6 (= f_~i~1 0) .cse5 .cse2) .cse9 (not (= 1 .cse1)) (not (= 0 |~#pp~0.offset|)) (not (= 1 (select .cse11 0))) .cse10 (and .cse3 (<= (* 4 f_~i~1) 7) .cse4 (<= 1 f_~i~1) .cse6 .cse5 .cse2))))) [2018-10-26 22:56:10,161 INFO L425 ceAbstractionStarter]: For program point L25-5(lines 23 32) no Hoare annotation was computed. [2018-10-26 22:56:10,161 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 23 32) no Hoare annotation was computed. [2018-10-26 22:56:10,161 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 23 32) the Hoare annotation is: (let ((.cse6 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse11 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse8 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse10 (+ |~#pstate~0.offset| 4))) (let ((.cse1 (not (= (select .cse8 .cse10) 0))) (.cse0 (select .cse11 |~#pp~0.offset|)) (.cse4 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse3 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse5 (not (= (select .cse11 .cse10) 0))) (.cse7 (not (= (select .cse6 .cse10) 0)))) (and (or (< |f_#in~pointer.offset| .cse0) .cse1 (and .cse2 .cse3 .cse4) (not (= 0 |~#pstate~0.offset|)) .cse5 (not (= 1 .cse0)) (not (= 0 |~#pp~0.offset|)) (not (= 1 (select .cse6 0))) .cse7) (let ((.cse9 (+ |f_#in~pointer.offset| |~#pp~0.offset|))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) .cse1 (not (= 0 .cse0)) (not (= (select .cse8 0) 0)) (and .cse4 .cse3 .cse2) (< .cse9 1) .cse5 (< |~#pp~0.offset| |f_#in~pointer.base|) (< 1 .cse9) (< 0 (+ |~#pp~0.offset| |f_#in~pointer.base|)) .cse7 (< (+ |~#pstate~0.offset| |f_#in~pointer.base|) 0) (< 0 (* 2 |~#pstate~0.offset|))))))) [2018-10-26 22:56:10,161 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2018-10-26 22:56:10,161 INFO L425 ceAbstractionStarter]: For program point L36-3(lines 36 42) no Hoare annotation was computed. [2018-10-26 22:56:10,162 INFO L421 ceAbstractionStarter]: At program point L36-4(lines 36 42) the Hoare annotation is: (let ((.cse23 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse25 (+ |~#pstate~0.offset| 4)) (.cse22 (select |#memory_int| |~#pstate~0.base|))) (let ((.cse14 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse5 (= 1 (select .cse22 (- (+ (- |~#pstate~0.offset|) (- 4)))))) (.cse27 (not (= (select .cse23 .cse25) 1)))) (let ((.cse6 (= 1 (select .cse22 0))) (.cse1 (or .cse27 (not (= 1 (select .cse23 0))))) (.cse0 (<= 2 g_~i~2)) (.cse3 (and (= |~#pstate~0.offset| 0) (= g_~i~2 1) .cse5)) (.cse21 (select .cse14 |~#pp~0.offset|)) (.cse16 (select .cse14 0)) (.cse17 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (not (= 0 |~#pstate~0.offset|))) (.cse4 (not (= 0 |~#pp~0.offset|))) (.cse8 (= g_~pointer.base |g_#in~pointer.base|)) (.cse12 (= (select .cse22 |~#pstate~0.offset|) 2)) (.cse7 (<= 0 g_~i~2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7)) (let ((.cse20 (select .cse22 .cse25))) (let ((.cse11 (= 1 .cse20)) (.cse13 (<= (* 4 g_~i~2) 8)) (.cse19 (= .cse22 (let ((.cse24 (@diff .cse23 .cse22))) (store .cse23 .cse24 (select .cse22 .cse24))))) (.cse10 (= |g_#in~pointer.offset| .cse21)) (.cse9 (= |g_#in~pointer.offset| g_~pointer.offset)) (.cse18 (select .cse14 (+ |~#pp~0.offset| 4)))) (or (and .cse8 .cse9 (= |#memory_int| |old(#memory_int)|)) (and .cse10 .cse8 .cse11 .cse12 .cse13 (let ((.cse15 (- (+ (- |~#pp~0.offset|) (- 4))))) (or (not (= (select .cse14 .cse15) .cse16)) (not (= (select .cse17 .cse15) |g_#in~pointer.base|)))) .cse0) (and .cse6 .cse11 .cse0) .cse1 .cse2 (not (= 2 .cse18)) (and (and .cse8 (<= g_~i~2 1) .cse12 .cse19 (= g_~pointer.offset .cse16)) .cse9) .cse4 (and (= 2 .cse20) .cse13 (or (and .cse8 .cse19) (and .cse10 .cse8 .cse12)) .cse9 (= |g_#in~pointer.offset| .cse18))))) (or .cse0 (not (= 2 (select .cse23 |~#pstate~0.offset|))) .cse3 (not (= 1 .cse21)) (let ((.cse26 (- (+ (* (- 1) |~#pp~0.offset|) (- 4))))) (and (= .cse16 (select .cse14 .cse26)) (= |g_#in~pointer.base| (select .cse17 .cse26)))) (or .cse27 .cse2 .cse4) (and .cse8 .cse5 (= 2 g_~pointer.offset) .cse12 .cse7) (not (= |g_#in~pointer.offset| 2))))))) [2018-10-26 22:56:10,162 INFO L425 ceAbstractionStarter]: For program point L36-5(lines 34 43) no Hoare annotation was computed. [2018-10-26 22:56:10,162 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 34 43) no Hoare annotation was computed. [2018-10-26 22:56:10,162 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-26 22:56:10,162 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-10-26 22:56:10,162 INFO L421 ceAbstractionStarter]: At program point L39-2(line 39) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse3 (not (= (select .cse0 (+ |~#pstate~0.offset| 4)) 1))) (.cse4 (not (= 0 |~#pstate~0.offset|))) (.cse5 (not (= 0 |~#pp~0.offset|)))) (and (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (or (not (= 2 (select .cse0 |~#pstate~0.offset|))) (not (= 1 (select .cse1 |~#pp~0.offset|))) (let ((.cse2 (- (+ (* (- 1) |~#pp~0.offset|) (- 4))))) (and (= (select .cse1 0) (select .cse1 .cse2)) (= |g_#in~pointer.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse2)))) (or .cse3 .cse4 .cse5) (not (= |g_#in~pointer.offset| 2)))) (or (or .cse3 (not (= 1 (select .cse0 0)))) .cse4 .cse5)))) [2018-10-26 22:56:10,162 INFO L421 ceAbstractionStarter]: At program point gENTRY(lines 34 43) the Hoare annotation is: (let ((.cse6 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse9 (+ |~#pstate~0.offset| 4))) (let ((.cse2 (select |#memory_int| |~#pstate~0.base|)) (.cse8 (not (= (select .cse6 .cse9) 1)))) (let ((.cse0 (or .cse8 (not (= 1 (select .cse6 0))))) (.cse3 (= 1 (select .cse2 .cse9))) (.cse5 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (not (= 0 |~#pstate~0.offset|))) (.cse4 (not (= 0 |~#pp~0.offset|)))) (and (or .cse0 .cse1 (and (= 1 (select .cse2 0)) .cse3) .cse4) (or .cse0 .cse1 (not (= 2 (select .cse5 (+ |~#pp~0.offset| 4)))) .cse4 (= |#memory_int| |old(#memory_int)|)) (or (and (= (select .cse2 |~#pstate~0.offset|) 2) .cse3) (not (= 2 (select .cse6 |~#pstate~0.offset|))) (not (= 1 (select .cse5 |~#pp~0.offset|))) (let ((.cse7 (- (+ (* (- 1) |~#pp~0.offset|) (- 4))))) (and (= (select .cse5 0) (select .cse5 .cse7)) (= |g_#in~pointer.base| (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse7)))) (or .cse8 .cse1 .cse4) (not (= |g_#in~pointer.offset| 2))))))) [2018-10-26 22:56:10,163 INFO L425 ceAbstractionStarter]: For program point L39-3(line 39) no Hoare annotation was computed. [2018-10-26 22:56:10,163 INFO L425 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-10-26 22:56:10,163 INFO L425 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-10-26 22:56:10,163 INFO L425 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-10-26 22:56:10,163 INFO L428 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-10-26 22:56:10,163 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 22:56:10,163 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse0 (+ |~#pstate~0.offset| 4))) (= 0 (select .cse1 (+ |~#pp~0.offset| 4))) (not (= |~#pstate~0.base| 0)) (= 0 (select .cse0 0)) (<= 0 (* 2 |~#pp~0.offset|)) (not (= |~#pp~0.base| 0)) (<= (+ |~#pp~0.offset| 1) ~counter~0) (= 0 (select .cse1 |~#pp~0.offset|)) (= 0 (select (select |#memory_int| |~#pstate~0.base|) (- (+ (- |~#pstate~0.offset|) (- 4))))) (<= 0 (* 2 |~#pstate~0.offset|)) (<= (+ ~counter~0 |~#pstate~0.offset|) 1))) [2018-10-26 22:56:10,163 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 22:56:10,163 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 22:56:10,163 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-26 22:56:10,164 INFO L421 ceAbstractionStarter]: At program point L62(line 62) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |~#pstate~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (let ((.cse3 (<= main_~b~0.offset (+ main_~b~0.base 2))) (.cse4 (= 1 (select .cse2 .cse1))) (.cse5 (<= (* 2 main_~a~0.base) 0)) (.cse6 (<= (+ main_~a~0.offset 1) main_~b~0.offset)) (.cse7 (<= 1 (+ main_~a~0.offset main_~a~0.base))) (.cse8 (<= (+ main_~b~0.base main_~a~0.offset) 1)) (.cse9 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse10 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= main_~b~0.offset (select .cse0 .cse1)) (= (select .cse2 |~#pstate~0.offset|) 2) (= main_~a~0.base (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse1)) (= 1 (select .cse0 |~#pp~0.offset|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (and (= 1 (select .cse2 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse9 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (not (= 0 (select .cse10 |~#pp~0.offset|))) (not (= (select .cse9 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse10 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|))))) [2018-10-26 22:56:10,164 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 51 69) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse0 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_int| |old(#memory_int)|) (<= 2 (* 2 ~counter~0)) (<= (+ ~counter~0 |~#pstate~0.offset|) 1)) (not (= 0 (select .cse2 |~#pp~0.offset|))) (not (= (select .cse0 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse2 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-10-26 22:56:10,164 INFO L421 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse4 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse5 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (let ((.cse0 (select |#memory_int| |~#pstate~0.base|)) (.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse3 (+ main_~a~0.offset 1))) (and (= 1 (select .cse0 0)) (= main_~a~0.base (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse1)) (= 2 (select .cse2 (+ |~#pp~0.offset| 4))) (<= .cse3 ~counter~0) (<= main_~b~0.offset (+ main_~b~0.base 2)) (= 1 (select .cse0 .cse1)) (<= (+ (select .cse2 |~#pp~0.offset|) 1) main_~b~0.offset) (<= (* 2 main_~a~0.base) 0) (<= .cse3 main_~b~0.offset) (<= 1 (+ main_~a~0.offset main_~a~0.base)) (<= (+ main_~b~0.base main_~a~0.offset) 1))) (not (= (select .cse4 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (not (= 0 (select .cse5 |~#pp~0.offset|))) (not (= (select .cse4 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse5 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-10-26 22:56:10,164 INFO L421 ceAbstractionStarter]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse0 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (not (= 0 (select .cse2 |~#pp~0.offset|))) (not (= (select .cse0 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (let ((.cse3 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse4 (+ main_~a~0.offset 1)) (.cse5 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse3 .cse1)) (= 0 (select (select |#memory_int| |~#pstate~0.base|) (- (+ (- |~#pstate~0.offset|) (- 4))))) (<= .cse4 ~counter~0) (<= main_~b~0.offset (+ main_~b~0.base 2)) (= 0 (select .cse5 (+ |~#pp~0.offset| 4))) (<= (* 2 main_~a~0.base) 0) (= 0 (select .cse3 0)) (<= .cse4 main_~b~0.offset) (= 0 (select .cse5 |~#pp~0.offset|)) (<= 1 (+ main_~a~0.offset main_~a~0.base)) (<= (+ main_~b~0.base main_~a~0.offset) 1))) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse2 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-10-26 22:56:10,164 INFO L421 ceAbstractionStarter]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse5 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse6 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (let ((.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse2 (select |#memory_int| |~#pstate~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse3 (select .cse4 |~#pp~0.offset|))) (and (= 0 (select .cse0 .cse1)) (= 1 (select .cse2 0)) (= 0 (select .cse2 (- (+ (- |~#pstate~0.offset|) (- 4))))) (<= (+ main_~a~0.offset 1) ~counter~0) (<= main_~b~0.offset (+ main_~b~0.base 2)) (= (select .cse0 |~#pp~0.offset|) main_~a~0.base) (<= (+ |~#pstate~0.offset| main_~a~0.base) 0) (= main_~a~0.offset .cse3) (<= (+ .cse3 1) main_~b~0.offset) (= 0 (select .cse4 (+ |~#pp~0.offset| 4))) (<= 1 (+ main_~a~0.offset main_~a~0.base)) (<= (+ main_~b~0.base main_~a~0.offset) 1)))) (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse5 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (not (= 0 (select .cse6 |~#pp~0.offset|))) (not (= (select .cse5 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse6 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-10-26 22:56:10,164 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2018-10-26 22:56:10,164 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 51 69) no Hoare annotation was computed. [2018-10-26 22:56:10,165 INFO L421 ceAbstractionStarter]: At program point L56(line 56) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse0 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (not (= 0 (select .cse2 |~#pp~0.offset|))) (not (= (select .cse0 0) 0)) (let ((.cse3 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse3 .cse1)) (= 0 (select (select |#memory_int| |~#pstate~0.base|) (- (+ (- |~#pstate~0.offset|) (- 4))))) (= 0 (select .cse4 (+ |~#pp~0.offset| 4))) (<= (* 2 main_~a~0.base) 0) (= 0 (select .cse3 0)) (= ~counter~0 (+ main_~a~0.offset 1)) (<= main_~a~0.offset (+ main_~a~0.base 1)) (= 0 (select .cse4 |~#pp~0.offset|)) (<= 1 (+ main_~a~0.offset main_~a~0.base)))) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse2 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-10-26 22:56:10,165 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-26 22:56:10,165 INFO L425 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2018-10-26 22:56:10,165 INFO L421 ceAbstractionStarter]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse0 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |#memory_int| |old(#memory_int)|) (<= 2 (* 2 ~counter~0)) (<= (+ ~counter~0 |~#pstate~0.offset|) 1)) (not (= 0 (select .cse2 |~#pp~0.offset|))) (not (= (select .cse0 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse2 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-10-26 22:56:10,165 INFO L421 ceAbstractionStarter]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (+ |~#pstate~0.offset| 4))) (or (= 0 |~#pp~0.base|) (= 0 |~#pstate~0.base|) (not (= (select .cse0 .cse1) 0)) (< 1 (+ |old(~counter~0)| |~#pp~0.offset|)) (not (= 0 (select .cse2 |~#pp~0.offset|))) (not (= (select .cse0 0) 0)) (< (+ |old(~counter~0)| |~#pstate~0.offset|) 1) (let ((.cse3 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= 0 (select .cse3 .cse1)) (= 0 (select (select |#memory_int| |~#pstate~0.base|) (- (+ (- |~#pstate~0.offset|) (- 4))))) (= 0 (select .cse4 (+ |~#pp~0.offset| 4))) (= 0 (select .cse3 0)) (<= 2 (* 2 ~counter~0)) (= 0 (select .cse4 |~#pp~0.offset|)) (<= (+ ~counter~0 |~#pstate~0.offset|) 1))) (not (= 0 (select (select |old(#memory_int)| |~#pstate~0.base|) (- (+ (* (- 1) |~#pstate~0.offset|) (- 4)))))) (not (= (select .cse2 .cse1) 0)) (< (* 2 |~#pp~0.offset|) 0) (< 0 (* 2 |~#pstate~0.offset|)))) [2018-10-26 22:56:10,165 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 51 69) no Hoare annotation was computed. [2018-10-26 22:56:10,169 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,169 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,170 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,170 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,170 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,170 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,171 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,171 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,171 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,173 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,173 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,173 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,173 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,173 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,176 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,177 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,178 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,178 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,178 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,178 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,178 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,192 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,192 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,193 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,193 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,193 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,193 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,193 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,194 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,194 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,194 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,194 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,195 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,195 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,195 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,195 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,195 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,195 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,196 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,196 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,196 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,197 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,197 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,197 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,197 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,197 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,197 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,198 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,214 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,215 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,215 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,215 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,215 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,215 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,215 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,216 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,216 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,216 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,216 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,216 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,216 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,217 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,217 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,217 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,217 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,217 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,217 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,220 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:551) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:246) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:313) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:108) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:537) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-26 22:56:10,233 INFO L168 Benchmark]: Toolchain (without parser) took 86090.88 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 964.5 MB in the beginning and 1.6 GB in the end (delta: -661.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-10-26 22:56:10,233 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:56:10,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.09 ms. Allocated memory is still 1.0 GB. Free memory was 964.5 MB in the beginning and 953.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:56:10,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.44 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 948.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:56:10,234 INFO L168 Benchmark]: Boogie Preprocessor took 34.41 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:56:10,234 INFO L168 Benchmark]: RCFGBuilder took 643.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-10-26 22:56:10,234 INFO L168 Benchmark]: TraceAbstraction took 85182.63 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -505.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-10-26 22:56:10,236 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.09 ms. Allocated memory is still 1.0 GB. Free memory was 964.5 MB in the beginning and 953.8 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 37.44 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 948.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.41 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 643.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 85182.63 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -505.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 25]: Loop Invariant [2018-10-26 22:56:10,251 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,251 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,252 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,252 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,252 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,252 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,252 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,252 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,253 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,253 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,253 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,253 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,253 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,254 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,254 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,254 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,254 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,260 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,260 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,260 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,262 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,262 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,262 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,262 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,262 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,262 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,263 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,264 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,265 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,265 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,265 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,265 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,265 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,266 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,266 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,266 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,279 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,279 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,279 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,279 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,280 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,280 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,280 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,280 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,280 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,280 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,280 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,281 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,281 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,281 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:56:10,281 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,281 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:56:10,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,290 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,291 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,291 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,291 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,291 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,291 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,291 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,292 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,292 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,292 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,292 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,292 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,292 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,293 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,293 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,293 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,293 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,293 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,293 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,293 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,294 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,294 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:56:10,294 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,294 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,294 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:56:10,294 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((0 == pp || 0 == pstate) || !(\old(#memory_$Pointer$)[pp][pstate + 4] == 0)) || !(0 == \old(#memory_$Pointer$)[pp][pp])) || ((((((#memory_$Pointer$ == \old(#memory_$Pointer$) && pointer == pointer) && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && 2 * i <= 0) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 0 <= pp + i)) || !(\old(#memory_$Pointer$)[pp][0] == 0)) || pointer + pp < 1) || !(\old(#memory_$Pointer$)[pp][pstate + 4] == 0)) || pp < pointer) || 1 < pointer + pp) || 0 < pp + pointer) || !(\old(unknown-#memory_int-unknown)[pstate][pstate + 4] == 0)) || pstate + pointer < 0) || 0 < 2 * pstate) && (((((((((pointer < \old(#memory_$Pointer$)[pp][pp] || !(\old(#memory_$Pointer$)[pp][pstate + 4] == 0)) || !(0 == pstate)) || (((((pointer == pointer && pointer == pointer) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && i == 0) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(\old(#memory_$Pointer$)[pp][pstate + 4] == 0)) || !(1 == \old(#memory_$Pointer$)[pp][pp])) || !(0 == pp)) || !(1 == \old(unknown-#memory_int-unknown)[pstate][0])) || !(\old(unknown-#memory_int-unknown)[pstate][pstate + 4] == 0)) || ((((((pointer == pointer && 4 * i <= 7) && pointer == pointer) && 1 <= i) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:551) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 22:56:12,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:56:12,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:56:12,166 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:56:12,166 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:56:12,167 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:56:12,168 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:56:12,169 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:56:12,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:56:12,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:56:12,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:56:12,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:56:12,173 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:56:12,173 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:56:12,174 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:56:12,175 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:56:12,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:56:12,177 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:56:12,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:56:12,179 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:56:12,180 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:56:12,181 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:56:12,182 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:56:12,183 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:56:12,183 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:56:12,183 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:56:12,184 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:56:12,185 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:56:12,185 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:56:12,186 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:56:12,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:56:12,187 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:56:12,187 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:56:12,187 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:56:12,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:56:12,188 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:56:12,189 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 22:56:12,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:56:12,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:56:12,204 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:56:12,204 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 22:56:12,204 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 22:56:12,205 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 22:56:12,205 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 22:56:12,205 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 22:56:12,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:56:12,206 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:56:12,206 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:56:12,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:56:12,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:56:12,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:56:12,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:56:12,206 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 22:56:12,207 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 22:56:12,207 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:56:12,207 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:56:12,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:56:12,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:56:12,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:56:12,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:56:12,208 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:56:12,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:56:12,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:56:12,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:56:12,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:56:12,208 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 22:56:12,208 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:56:12,209 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 22:56:12,209 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 22:56:12,209 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_d9c0ef58-f946-4f6e-b38b-4a38074c591b/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 -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2018-10-26 22:56:12,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:56:12,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:56:12,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:56:12,264 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:56:12,265 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:56:12,266 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-10-26 22:56:12,315 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/data/c1bf575c8/064c3d742ab54eb3a5e89befd7f3c761/FLAGc05eda653 [2018-10-26 22:56:12,708 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:56:12,708 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-10-26 22:56:12,715 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/data/c1bf575c8/064c3d742ab54eb3a5e89befd7f3c761/FLAGc05eda653 [2018-10-26 22:56:12,732 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/data/c1bf575c8/064c3d742ab54eb3a5e89befd7f3c761 [2018-10-26 22:56:12,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:56:12,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:56:12,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:56:12,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:56:12,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:56:12,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:56:12" (1/1) ... [2018-10-26 22:56:12,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec404ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:12, skipping insertion in model container [2018-10-26 22:56:12,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:56:12" (1/1) ... [2018-10-26 22:56:12,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:56:12,779 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:56:12,946 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:56:12,953 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:56:12,977 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:56:13,007 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:56:13,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:13 WrapperNode [2018-10-26 22:56:13,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:56:13,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:56:13,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:56:13,010 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:56:13,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:13" (1/1) ... [2018-10-26 22:56:13,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:13" (1/1) ... [2018-10-26 22:56:13,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:56:13,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:56:13,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:56:13,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:56:13,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:13" (1/1) ... [2018-10-26 22:56:13,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:13" (1/1) ... [2018-10-26 22:56:13,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:13" (1/1) ... [2018-10-26 22:56:13,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:13" (1/1) ... [2018-10-26 22:56:13,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:13" (1/1) ... [2018-10-26 22:56:13,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:13" (1/1) ... [2018-10-26 22:56:13,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:13" (1/1) ... [2018-10-26 22:56:13,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:56:13,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:56:13,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:56:13,095 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:56:13,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/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-10-26 22:56:13,214 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-10-26 22:56:13,214 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-10-26 22:56:13,214 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-26 22:56:13,214 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-10-26 22:56:13,215 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-10-26 22:56:13,215 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-10-26 22:56:13,215 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-10-26 22:56:13,215 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-10-26 22:56:13,215 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-10-26 22:56:13,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-10-26 22:56:13,215 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:56:13,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:56:13,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:56:13,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:56:13,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:56:13,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:56:13,783 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:56:13,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:56:13 BoogieIcfgContainer [2018-10-26 22:56:13,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:56:13,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:56:13,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:56:13,788 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:56:13,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:56:12" (1/3) ... [2018-10-26 22:56:13,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426743c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:56:13, skipping insertion in model container [2018-10-26 22:56:13,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:56:13" (2/3) ... [2018-10-26 22:56:13,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426743c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:56:13, skipping insertion in model container [2018-10-26 22:56:13,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:56:13" (3/3) ... [2018-10-26 22:56:13,792 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-10-26 22:56:13,800 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:56:13,807 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:56:13,820 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:56:13,844 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:56:13,845 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:56:13,845 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:56:13,845 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:56:13,845 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:56:13,845 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:56:13,845 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:56:13,845 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:56:13,845 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:56:13,858 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-10-26 22:56:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 22:56:13,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:13,866 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:13,868 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:13,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:13,874 INFO L82 PathProgramCache]: Analyzing trace with hash -914248174, now seen corresponding path program 1 times [2018-10-26 22:56:13,877 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:13,877 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:13,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:13,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:56:14,008 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Stream closed [2018-10-26 22:56:14,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:56:14,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 22:56:14,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 22:56:14,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 22:56:14,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:56:14,030 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-10-26 22:56:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:14,056 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2018-10-26 22:56:14,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 22:56:14,057 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2018-10-26 22:56:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:14,064 INFO L225 Difference]: With dead ends: 89 [2018-10-26 22:56:14,065 INFO L226 Difference]: Without dead ends: 44 [2018-10-26 22:56:14,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 22:56:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-26 22:56:14,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-26 22:56:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-26 22:56:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-10-26 22:56:14,104 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 40 [2018-10-26 22:56:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:14,104 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-10-26 22:56:14,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 22:56:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-10-26 22:56:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 22:56:14,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:14,108 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:14,108 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:14,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:14,109 INFO L82 PathProgramCache]: Analyzing trace with hash -622423070, now seen corresponding path program 1 times [2018-10-26 22:56:14,109 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:14,109 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:14,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:14,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:56:14,332 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:56:14,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:56:14,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:56:14,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:56:14,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:56:14,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:56:14,337 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-10-26 22:56:14,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:14,414 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-10-26 22:56:14,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:56:14,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-26 22:56:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:14,423 INFO L225 Difference]: With dead ends: 80 [2018-10-26 22:56:14,423 INFO L226 Difference]: Without dead ends: 47 [2018-10-26 22:56:14,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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-10-26 22:56:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-26 22:56:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-26 22:56:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-26 22:56:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-10-26 22:56:14,433 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2018-10-26 22:56:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:14,433 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-10-26 22:56:14,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:56:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-10-26 22:56:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-26 22:56:14,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:14,436 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:14,436 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:14,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash -485166222, now seen corresponding path program 1 times [2018-10-26 22:56:14,437 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:14,437 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:14,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:14,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:56:14,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:56:14,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:14,796 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:14,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:14,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:56:14,970 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:56:14,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:56:14,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2018-10-26 22:56:14,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 22:56:14,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 22:56:14,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:56:14,996 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 7 states. [2018-10-26 22:56:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:15,357 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2018-10-26 22:56:15,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 22:56:15,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-10-26 22:56:15,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:15,362 INFO L225 Difference]: With dead ends: 89 [2018-10-26 22:56:15,362 INFO L226 Difference]: Without dead ends: 56 [2018-10-26 22:56:15,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 22:56:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-26 22:56:15,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-10-26 22:56:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-26 22:56:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-10-26 22:56:15,373 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 46 [2018-10-26 22:56:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:15,373 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-10-26 22:56:15,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 22:56:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-10-26 22:56:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-26 22:56:15,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:15,376 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:15,376 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:15,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:15,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1740986502, now seen corresponding path program 1 times [2018-10-26 22:56:15,377 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:15,378 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:15,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:15,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:15,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:56:15,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:56:15,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:15,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:15,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:15,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-26 22:56:15,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:56:15,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 22:56:15,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:15,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:15,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:15,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-10-26 22:56:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:56:16,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:16,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-10-26 22:56:16,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-10-26 22:56:16,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:16,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:16,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:16,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-10-26 22:56:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:56:16,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:16,879 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:16,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:16,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:16,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:56:16,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:56:16,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:16,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:16,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:16,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-26 22:56:17,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:56:17,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 22:56:17,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:17,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:17,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:17,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-10-26 22:56:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:56:17,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:17,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-10-26 22:56:17,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-10-26 22:56:17,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:17,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:17,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:17,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-10-26 22:56:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 22:56:17,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:56:17,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15, 14] total 27 [2018-10-26 22:56:17,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-26 22:56:17,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-26 22:56:17,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2018-10-26 22:56:17,445 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 27 states. [2018-10-26 22:56:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:19,832 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2018-10-26 22:56:19,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-26 22:56:19,832 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-10-26 22:56:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:19,833 INFO L225 Difference]: With dead ends: 102 [2018-10-26 22:56:19,834 INFO L226 Difference]: Without dead ends: 86 [2018-10-26 22:56:19,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2018-10-26 22:56:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-26 22:56:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2018-10-26 22:56:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-26 22:56:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2018-10-26 22:56:19,848 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 51 [2018-10-26 22:56:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:19,849 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2018-10-26 22:56:19,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-26 22:56:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2018-10-26 22:56:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-26 22:56:19,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:19,851 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:19,852 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:19,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:19,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1192231495, now seen corresponding path program 1 times [2018-10-26 22:56:19,852 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:19,852 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:19,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:20,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:56:20,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:56:20,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:20,084 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:20,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:20,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:20,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:56:20,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:56:20,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:20,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:20,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:20,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-26 22:56:20,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:56:20,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 22:56:20,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:20,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:20,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:20,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-10-26 22:56:20,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 22:56:20,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 22:56:20,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:20,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:20,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:20,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 22:56:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 22:56:20,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:20,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-26 22:56:20,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:56:20,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:20,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:20,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:20,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-10-26 22:56:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 22:56:20,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:56:20,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 8, 7] total 16 [2018-10-26 22:56:20,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 22:56:20,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 22:56:20,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-10-26 22:56:20,553 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 16 states. [2018-10-26 22:56:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:21,575 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2018-10-26 22:56:21,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 22:56:21,576 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-10-26 22:56:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:21,578 INFO L225 Difference]: With dead ends: 146 [2018-10-26 22:56:21,578 INFO L226 Difference]: Without dead ends: 115 [2018-10-26 22:56:21,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=832, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 22:56:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-26 22:56:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 93. [2018-10-26 22:56:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-26 22:56:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2018-10-26 22:56:21,605 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 54 [2018-10-26 22:56:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:21,606 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2018-10-26 22:56:21,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 22:56:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2018-10-26 22:56:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-26 22:56:21,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:21,611 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:21,611 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:21,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:21,611 INFO L82 PathProgramCache]: Analyzing trace with hash -411043866, now seen corresponding path program 1 times [2018-10-26 22:56:21,612 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:21,612 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:21,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:21,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:22,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:56:22,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:56:22,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:22,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:22,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:22,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:56:22,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 22:56:22,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:56:22,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:22,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:22,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:22,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-10-26 22:56:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:56:22,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:22,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-26 22:56:22,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-10-26 22:56:22,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:22,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:22,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:22,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-10-26 22:56:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:56:23,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:23,069 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:23,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:23,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:23,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:56:23,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:56:23,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:23,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:23,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:23,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:56:23,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 22:56:23,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:56:23,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:23,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:23,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:23,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-10-26 22:56:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:56:23,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:23,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-26 22:56:23,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-10-26 22:56:23,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:23,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:23,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:23,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-10-26 22:56:23,414 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:56:23,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:56:23,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 19, 17] total 34 [2018-10-26 22:56:23,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-26 22:56:23,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-26 22:56:23,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-10-26 22:56:23,432 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand 34 states. [2018-10-26 22:56:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:26,522 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2018-10-26 22:56:26,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 22:56:26,524 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 59 [2018-10-26 22:56:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:26,525 INFO L225 Difference]: With dead ends: 184 [2018-10-26 22:56:26,525 INFO L226 Difference]: Without dead ends: 153 [2018-10-26 22:56:26,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 200 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=188, Invalid=1792, Unknown=0, NotChecked=0, Total=1980 [2018-10-26 22:56:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-26 22:56:26,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 144. [2018-10-26 22:56:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-26 22:56:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 174 transitions. [2018-10-26 22:56:26,552 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 174 transitions. Word has length 59 [2018-10-26 22:56:26,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:26,552 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 174 transitions. [2018-10-26 22:56:26,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-26 22:56:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2018-10-26 22:56:26,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-26 22:56:26,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:26,555 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:26,556 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:26,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:26,556 INFO L82 PathProgramCache]: Analyzing trace with hash 934622484, now seen corresponding path program 2 times [2018-10-26 22:56:26,556 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:26,557 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:26,572 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 22:56:26,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:56:26,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:56:26,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:26,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:56:26,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:56:26,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:26,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:26,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:26,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:56:26,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:56:26,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:56:26,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:26,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:26,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:56:26,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:56:26,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:56:26,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-10-26 22:56:27,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:56:27,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:56:27,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-10-26 22:56:27,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:56:27,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:56:27,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-26 22:56:27,378 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:56:27,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-10-26 22:56:27,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:12 [2018-10-26 22:56:27,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-10-26 22:56:27,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-10-26 22:56:27,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:27,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:7 [2018-10-26 22:56:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 17 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 22:56:27,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:28,059 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-26 22:56:28,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:28,093 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:28,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 22:56:28,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:56:28,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:56:28,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:28,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:56:28,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:56:28,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 22:56:28,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 22:56:28,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,536 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-10-26 22:56:28,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:56:28,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:56:28,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:56:28,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:56:28,693 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:56:28,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:56:28,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,718 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-10-26 22:56:28,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:56:28,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:56:28,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:56:28,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:56:28,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:28,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-10-26 22:56:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 22:56:28,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:29,310 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-26 22:56:29,411 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-26 22:56:29,592 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 22:56:29,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:29,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:29,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:31, output treesize:1 [2018-10-26 22:56:29,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-26 22:56:29,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-10-26 22:56:30,007 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 22:56:30,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-10-26 22:56:30,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:30,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2018-10-26 22:56:30,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:30,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:30,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:30,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-26 22:56:30,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-10-26 22:56:30,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2018-10-26 22:56:30,137 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:30,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-10-26 22:56:30,140 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:30,148 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:30,156 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:30,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:30,168 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:45, output treesize:23 [2018-10-26 22:56:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 22:56:30,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 22:56:30,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 10] total 31 [2018-10-26 22:56:30,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-26 22:56:30,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-26 22:56:30,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1121, Unknown=15, NotChecked=0, Total=1332 [2018-10-26 22:56:30,232 INFO L87 Difference]: Start difference. First operand 144 states and 174 transitions. Second operand 31 states. [2018-10-26 22:56:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:32,310 INFO L93 Difference]: Finished difference Result 209 states and 249 transitions. [2018-10-26 22:56:32,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-26 22:56:32,315 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-10-26 22:56:32,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:32,316 INFO L225 Difference]: With dead ends: 209 [2018-10-26 22:56:32,316 INFO L226 Difference]: Without dead ends: 126 [2018-10-26 22:56:32,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=425, Invalid=2007, Unknown=18, NotChecked=0, Total=2450 [2018-10-26 22:56:32,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-26 22:56:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2018-10-26 22:56:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-26 22:56:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2018-10-26 22:56:32,335 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 59 [2018-10-26 22:56:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:32,335 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2018-10-26 22:56:32,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-26 22:56:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2018-10-26 22:56:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-26 22:56:32,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:32,337 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:32,337 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:32,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:32,337 INFO L82 PathProgramCache]: Analyzing trace with hash -413561899, now seen corresponding path program 1 times [2018-10-26 22:56:32,337 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:32,338 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:32,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:56:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:32,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:32,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:56:32,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:56:32,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:32,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:32,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:56:32,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:56:32,656 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:32,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:32,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:32,665 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-10-26 22:56:32,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 22:56:32,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:56:32,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:32,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:32,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:56:32,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 22:56:32,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:32,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:32,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:32,733 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:10 [2018-10-26 22:56:32,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-10-26 22:56:33,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-10-26 22:56:33,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-10-26 22:56:33,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-10-26 22:56:33,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:15 [2018-10-26 22:56:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-26 22:56:33,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:33,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-10-26 22:56:33,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:56:33,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:33,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-10-26 22:56:33,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:56:33,505 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:33,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:56:33,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:12 [2018-10-26 22:56:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 22:56:33,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:33,610 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:33,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:33,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:33,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:56:33,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:56:33,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:56:33,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:56:33,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,694 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-10-26 22:56:33,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 22:56:33,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:56:33,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 22:56:33,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:56:33,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:33,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-10-26 22:56:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 22:56:33,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:34,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-10-26 22:56:34,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:56:34,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:34,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:34,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-10-26 22:56:34,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-10-26 22:56:34,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:34,132 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:34,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 22:56:34,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:12 [2018-10-26 22:56:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 22:56:34,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:56:34,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10, 9] total 25 [2018-10-26 22:56:34,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-26 22:56:34,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-26 22:56:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-10-26 22:56:34,180 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand 25 states. [2018-10-26 22:56:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:35,868 INFO L93 Difference]: Finished difference Result 161 states and 187 transitions. [2018-10-26 22:56:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-26 22:56:35,869 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-10-26 22:56:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:35,870 INFO L225 Difference]: With dead ends: 161 [2018-10-26 22:56:35,870 INFO L226 Difference]: Without dead ends: 132 [2018-10-26 22:56:35,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=963, Unknown=0, NotChecked=0, Total=1122 [2018-10-26 22:56:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-26 22:56:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2018-10-26 22:56:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-26 22:56:35,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 147 transitions. [2018-10-26 22:56:35,892 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 147 transitions. Word has length 62 [2018-10-26 22:56:35,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:35,893 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 147 transitions. [2018-10-26 22:56:35,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-26 22:56:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 147 transitions. [2018-10-26 22:56:35,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 22:56:35,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:35,897 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:35,898 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:35,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:35,898 INFO L82 PathProgramCache]: Analyzing trace with hash -449292819, now seen corresponding path program 3 times [2018-10-26 22:56:35,898 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:35,898 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:35,922 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-10-26 22:56:36,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 22:56:36,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:56:36,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:56:36,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:56:36,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:36,440 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:36,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 22:56:37,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 22:56:37,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:56:37,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:56:37,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:56:37,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:56:37,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 8 [2018-10-26 22:56:37,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 22:56:37,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 22:56:37,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:56:37,822 INFO L87 Difference]: Start difference. First operand 128 states and 147 transitions. Second operand 8 states. [2018-10-26 22:56:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:37,899 INFO L93 Difference]: Finished difference Result 194 states and 229 transitions. [2018-10-26 22:56:37,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:56:37,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-10-26 22:56:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:37,901 INFO L225 Difference]: With dead ends: 194 [2018-10-26 22:56:37,902 INFO L226 Difference]: Without dead ends: 140 [2018-10-26 22:56:37,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:56:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-26 22:56:37,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-10-26 22:56:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-26 22:56:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2018-10-26 22:56:37,920 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 63 [2018-10-26 22:56:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:37,921 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2018-10-26 22:56:37,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 22:56:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2018-10-26 22:56:37,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 22:56:37,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:37,922 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:37,922 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:37,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:37,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1726401345, now seen corresponding path program 4 times [2018-10-26 22:56:37,924 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:37,925 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:37,955 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:56:38,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:56:38,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:56:38,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:56:38,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:56:38,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:38,207 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:38,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 22:56:38,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 22:56:38,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:56:38,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:56:38,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 22:56:38,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:56:38,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 8 [2018-10-26 22:56:38,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 22:56:38,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 22:56:38,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:56:38,315 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand 8 states. [2018-10-26 22:56:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:38,373 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2018-10-26 22:56:38,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 22:56:38,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-10-26 22:56:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:38,376 INFO L225 Difference]: With dead ends: 202 [2018-10-26 22:56:38,376 INFO L226 Difference]: Without dead ends: 124 [2018-10-26 22:56:38,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:56:38,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-26 22:56:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2018-10-26 22:56:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-26 22:56:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-10-26 22:56:38,394 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 63 [2018-10-26 22:56:38,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:38,394 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-10-26 22:56:38,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 22:56:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-10-26 22:56:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 22:56:38,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:38,396 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:38,396 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:38,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:38,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1061585402, now seen corresponding path program 1 times [2018-10-26 22:56:38,397 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:38,397 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:38,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:56:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:38,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:38,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:56:38,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:56:38,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:38,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:38,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:38,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:56:39,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:56:39,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 22:56:39,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:39,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:39,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:39,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-10-26 22:56:39,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:56:39,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:56:39,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:56:39,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:39,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:39,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:39,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-10-26 22:56:39,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:56:39,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 22:56:39,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:39,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:39,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:39,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-10-26 22:56:39,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 22:56:39,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:56:39,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:39,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:39,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:39,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-10-26 22:56:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 21 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 22:56:39,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:40,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-10-26 22:56:40,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-10-26 22:56:40,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-10-26 22:56:40,164 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 22:56:40,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:40,166 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:40,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:40,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:40,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:56:40,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:56:40,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:56:40,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:56:40,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 22:56:40,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-10-26 22:56:40,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:56:40,506 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:56:40,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:56:40,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2018-10-26 22:56:40,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:56:40,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 22:56:40,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-10-26 22:56:40,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 22:56:40,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:56:40,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:40,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-10-26 22:56:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 25 refuted. 2 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 22:56:40,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:41,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-26 22:56:41,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-10-26 22:56:41,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:41,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:41,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:41,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-10-26 22:56:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 22:56:41,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:56:41,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18, 15] total 51 [2018-10-26 22:56:41,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-26 22:56:41,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-26 22:56:41,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2307, Unknown=15, NotChecked=0, Total=2550 [2018-10-26 22:56:41,373 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 51 states. [2018-10-26 22:56:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:46,394 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2018-10-26 22:56:46,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-26 22:56:46,395 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 64 [2018-10-26 22:56:46,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:46,396 INFO L225 Difference]: With dead ends: 162 [2018-10-26 22:56:46,396 INFO L226 Difference]: Without dead ends: 140 [2018-10-26 22:56:46,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 200 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=670, Invalid=5293, Unknown=43, NotChecked=0, Total=6006 [2018-10-26 22:56:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-26 22:56:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2018-10-26 22:56:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-26 22:56:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-10-26 22:56:46,412 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 64 [2018-10-26 22:56:46,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:46,412 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-10-26 22:56:46,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-26 22:56:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-10-26 22:56:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-26 22:56:46,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:46,413 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:46,414 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:46,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:46,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1594544456, now seen corresponding path program 1 times [2018-10-26 22:56:46,414 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:46,414 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:46,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:46,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:46,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:56:46,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:56:46,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:46,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:46,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 22:56:46,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-26 22:56:47,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-10-26 22:56:47,324 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:56:47,325 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:56:47,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-10-26 22:56:47,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:47,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:47,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:47,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:9 [2018-10-26 22:56:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-26 22:56:47,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:47,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-26 22:56:47,903 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-10-26 22:56:47,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-10-26 22:56:47,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:47,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:47,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:47,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:4 [2018-10-26 22:56:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:56:48,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:48,198 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:48,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:48,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:48,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 22:56:48,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 22:56:48,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:48,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:48,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:48,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-26 22:56:49,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 22:56:49,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 22:56:49,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:49,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:49,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:49,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-10-26 22:56:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 22:56:49,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:49,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-26 22:56:49,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-10-26 22:56:49,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:49,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 22:56:49,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:49,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:4 [2018-10-26 22:56:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 22:56:49,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:56:49,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 18, 17] total 43 [2018-10-26 22:56:49,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-26 22:56:49,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-26 22:56:49,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2018-10-26 22:56:49,515 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 43 states. [2018-10-26 22:56:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:52,864 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-10-26 22:56:52,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-26 22:56:52,865 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 71 [2018-10-26 22:56:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:52,866 INFO L225 Difference]: With dead ends: 148 [2018-10-26 22:56:52,866 INFO L226 Difference]: Without dead ends: 138 [2018-10-26 22:56:52,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=433, Invalid=3857, Unknown=0, NotChecked=0, Total=4290 [2018-10-26 22:56:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-26 22:56:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 113. [2018-10-26 22:56:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-26 22:56:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2018-10-26 22:56:52,882 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 71 [2018-10-26 22:56:52,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:52,883 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2018-10-26 22:56:52,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-26 22:56:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2018-10-26 22:56:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-26 22:56:52,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:52,884 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:52,884 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:52,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:52,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1441419930, now seen corresponding path program 1 times [2018-10-26 22:56:52,885 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:52,885 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:52,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:53,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:53,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:56:53,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:56:53,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-10-26 22:56:53,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-10-26 22:56:53,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-10-26 22:56:53,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-10-26 22:56:53,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 22:56:53,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 22:56:53,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 22:56:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 22:56:53,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:53,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-10-26 22:56:53,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-10-26 22:56:53,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-10-26 22:56:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 22:56:53,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:53,525 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:53,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:53,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:53,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:56:53,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:56:53,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:56:53,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-10-26 22:56:53,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-10-26 22:56:53,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2018-10-26 22:56:53,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 22:56:53,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 22:56:53,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 22:56:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 22:56:53,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:53,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-10-26 22:56:53,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-10-26 22:56:53,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:53,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-10-26 22:56:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 22:56:53,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:56:53,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10, 9] total 23 [2018-10-26 22:56:53,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 22:56:53,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 22:56:53,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:56:53,864 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand 23 states. [2018-10-26 22:56:54,801 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 22:56:55,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:56:55,272 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-10-26 22:56:55,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 22:56:55,273 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-10-26 22:56:55,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:56:55,274 INFO L225 Difference]: With dead ends: 131 [2018-10-26 22:56:55,274 INFO L226 Difference]: Without dead ends: 79 [2018-10-26 22:56:55,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-10-26 22:56:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-26 22:56:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-26 22:56:55,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-26 22:56:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-26 22:56:55,283 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 73 [2018-10-26 22:56:55,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:56:55,283 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-26 22:56:55,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 22:56:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-26 22:56:55,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-26 22:56:55,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:56:55,284 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 22:56:55,284 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:56:55,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:56:55,284 INFO L82 PathProgramCache]: Analyzing trace with hash -409228882, now seen corresponding path program 1 times [2018-10-26 22:56:55,285 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:56:55,285 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 22:56:55,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:55,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:56,083 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 22:56:56,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:56:56,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:56:56,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-10-26 22:56:56,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:56:56,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 22:56:56,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-10-26 22:56:56,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:56:56,544 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:56:56,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:56:56,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-10-26 22:56:56,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:56:56,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 22:56:56,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-10-26 22:56:56,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 22:56:56,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:56:56,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:56,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-10-26 22:56:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 22 refuted. 2 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 22:56:56,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:57,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-10-26 22:56:57,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-10-26 22:56:57,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:57,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:57,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:57,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2018-10-26 22:56:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 22:56:57,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:56:57,959 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 22:56:57,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:56:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:56:58,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:56:58,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 22:56:58,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 22:56:58,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:56:58,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:56:58,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 22:56:58,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-10-26 22:56:58,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-26 22:56:58,350 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:56:58,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 22:56:58,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2018-10-26 22:56:58,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-10-26 22:56:58,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-10-26 22:56:58,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-10-26 22:56:58,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 22:56:58,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 22:56:58,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:58,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:8 [2018-10-26 22:56:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 25 refuted. 2 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 22:56:58,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:56:59,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-10-26 22:56:59,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-10-26 22:56:59,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:56:59,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:59,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:56:59,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-10-26 22:56:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 22:56:59,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 22:56:59,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 18, 15] total 56 [2018-10-26 22:56:59,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-26 22:56:59,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-26 22:56:59,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2804, Unknown=17, NotChecked=0, Total=3080 [2018-10-26 22:56:59,579 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 56 states. [2018-10-26 22:57:04,148 WARN L179 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-10-26 22:57:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:57:04,820 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-10-26 22:57:04,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-26 22:57:04,821 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 78 [2018-10-26 22:57:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:57:04,822 INFO L225 Difference]: With dead ends: 90 [2018-10-26 22:57:04,822 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 22:57:04,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 251 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=751, Invalid=5685, Unknown=44, NotChecked=0, Total=6480 [2018-10-26 22:57:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 22:57:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 22:57:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 22:57:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 22:57:04,824 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-10-26 22:57:04,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:57:04,824 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 22:57:04,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-26 22:57:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 22:57:04,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 22:57:04,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 22:57:05,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 22:57:05,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 22:57:05,506 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-10-26 22:57:05,992 WARN L179 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 61 [2018-10-26 22:57:06,160 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 49 [2018-10-26 22:57:08,112 WARN L179 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 144 DAG size of output: 102 [2018-10-26 22:57:08,539 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-10-26 22:57:09,017 WARN L179 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 64 [2018-10-26 22:57:09,203 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-10-26 22:57:09,358 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2018-10-26 22:57:09,670 WARN L179 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2018-10-26 22:57:09,931 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-10-26 22:57:10,072 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 41 [2018-10-26 22:57:10,130 INFO L421 ceAbstractionStarter]: At program point initENTRY(lines 15 21) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (not (= (_ bv0 32) (select .cse0 (bvadd |~#pp~0.offset| (_ bv4 32))))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)))) [2018-10-26 22:57:10,130 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 20) no Hoare annotation was computed. [2018-10-26 22:57:10,130 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 20) no Hoare annotation was computed. [2018-10-26 22:57:10,131 INFO L421 ceAbstractionStarter]: At program point L17-4(lines 17 20) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse2 (select .cse0 .cse3))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (and (= (_ bv0 32) (select .cse1 |~#pp~0.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|))) (= .cse2 (select .cse1 .cse3)))) (not (= (_ bv0 32) .cse2)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-10-26 22:57:10,131 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 15 21) no Hoare annotation was computed. [2018-10-26 22:57:10,131 INFO L425 ceAbstractionStarter]: For program point L17-5(lines 15 21) no Hoare annotation was computed. [2018-10-26 22:57:10,131 INFO L425 ceAbstractionStarter]: For program point mallocFINAL(lines 46 49) no Hoare annotation was computed. [2018-10-26 22:57:10,131 INFO L425 ceAbstractionStarter]: For program point mallocEXIT(lines 46 49) no Hoare annotation was computed. [2018-10-26 22:57:10,131 INFO L421 ceAbstractionStarter]: At program point mallocENTRY(lines 46 49) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse0 (not (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32)))) (.cse1 (not (= (select .cse5 |~#pp~0.offset|) (_ bv0 32)))) (.cse2 (not (= (_ bv0 32) (select .cse5 (bvadd |~#pp~0.offset| (_ bv4 32)))))) (.cse3 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse4 (not (= (_ bv0 32) |~#pp~0.offset|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) .cse2 .cse3 .cse4) (or (= (bvadd ~counter~0 (_ bv4294967294 32)) (_ bv0 32)) .cse0 .cse1 (not (= (bvadd |old(~counter~0)| (_ bv4294967294 32)) (_ bv0 32))) .cse2 .cse3 .cse4)))) [2018-10-26 22:57:10,131 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 22:57:10,131 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |~#pstate~0.base|)) (.cse0 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse2 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (and (or (not (= (bvadd (select .cse0 |~#pstate~0.offset|) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv1 32) (select .cse1 |~#pstate~0.offset|))) (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)) (= |old(~counter~0)| ~counter~0) (let ((.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (= (select .cse2 .cse3) (select .cse4 .cse3))) (let ((.cse5 (bvadd |~#pstate~0.offset| (_ bv4 32)))) (or (= (bvadd (select .cse1 .cse5) (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv1 32) (select .cse0 .cse5))))) (= (select .cse4 |~#pp~0.offset|) (select .cse2 |~#pp~0.offset|)))) [2018-10-26 22:57:10,131 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 22:57:10,131 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-10-26 22:57:10,132 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 25 31) no Hoare annotation was computed. [2018-10-26 22:57:10,132 INFO L425 ceAbstractionStarter]: For program point L25-3(lines 25 31) no Hoare annotation was computed. [2018-10-26 22:57:10,132 INFO L421 ceAbstractionStarter]: At program point L25-4(lines 25 31) the Hoare annotation is: (let ((.cse12 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse11 (select .cse12 (bvadd |~#pp~0.offset| (_ bv4 32)))) (.cse7 (= |old(#memory_int)| |#memory_int|)) (.cse8 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse9 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse10 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (let ((.cse1 (and .cse7 .cse8 .cse9 (= f_~pointer.base |f_#in~pointer.base|) .cse10 (= f_~i~1 (_ bv0 32)))) (.cse2 (= ~counter~0 .cse11)) (.cse3 (not (= (_ bv0 32) .cse11))) (.cse4 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse5 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse0 (select .cse12 |~#pp~0.offset|)) (.cse6 (= (bvadd ~counter~0 (_ bv1 32)) .cse11))) (and (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= .cse0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 (and .cse7 (= (_ bv2 32) f_~i~1) .cse8 .cse9 .cse10) (not (= (_ bv1 32) (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|))) .cse2 (and .cse7 .cse8 .cse9 (= (bvadd f_~i~1 (_ bv4294967295 32)) (_ bv0 32)) .cse10) .cse3 .cse4 .cse5 (not (= (bvadd .cse0 (_ bv4294967295 32)) (_ bv0 32))) .cse6))))) [2018-10-26 22:57:10,132 INFO L425 ceAbstractionStarter]: For program point L25-5(lines 23 32) no Hoare annotation was computed. [2018-10-26 22:57:10,132 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 23 32) no Hoare annotation was computed. [2018-10-26 22:57:10,132 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 23 32) the Hoare annotation is: (let ((.cse8 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse7 (select .cse8 (bvadd |~#pp~0.offset| (_ bv4 32))))) (let ((.cse5 (select .cse8 |~#pp~0.offset|)) (.cse1 (= ~counter~0 .cse7)) (.cse2 (not (= (_ bv0 32) .cse7))) (.cse3 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse4 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse0 (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (.cse6 (= (bvadd ~counter~0 (_ bv1 32)) .cse7))) (and (or (not (= (_ bv1 32) (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|))) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (bvadd .cse5 (_ bv4294967295 32)) (_ bv0 32))) .cse6) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= .cse5 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse0 .cse6))))) [2018-10-26 22:57:10,132 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2018-10-26 22:57:10,132 INFO L425 ceAbstractionStarter]: For program point L36-3(lines 36 42) no Hoare annotation was computed. [2018-10-26 22:57:10,133 INFO L421 ceAbstractionStarter]: At program point L36-4(lines 36 42) the Hoare annotation is: (let ((.cse25 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse16 (select .cse25 |~#pp~0.offset|))) (let ((.cse22 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse23 (bvadd |~#pstate~0.offset| (_ bv4 32))) (.cse12 (= (bvadd g_~i~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse10 (select .cse25 (bvadd |~#pp~0.offset| (_ bv4 32)))) (.cse24 (= (_ bv2 32) |g_#in~pointer.offset|)) (.cse20 (not (= (bvadd .cse16 (_ bv4294967295 32)) (_ bv0 32))))) (let ((.cse9 (not (= (_ bv1 32) |g_#in~pointer.offset|))) (.cse11 (= (_ bv1 32) g_~pointer.offset)) (.cse3 (or (not .cse24) .cse20)) (.cse18 (= ~counter~0 .cse10)) (.cse19 (not (= (_ bv0 32) .cse10))) (.cse21 (= (bvadd ~counter~0 (_ bv1 32)) .cse10)) (.cse2 (= (_ bv2 32) g_~i~2)) (.cse7 (= g_~i~2 (_ bv0 32))) (.cse1 (= |old(#memory_int)| |#memory_int|)) (.cse8 (= |g_#in~pointer.offset| g_~pointer.offset)) (.cse0 (or (and .cse12 (= (_ bv1 32) .cse16) .cse24) (and .cse12 (exists ((|f_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |f_write~$Pointer$_#ptr.offset|)))))) (.cse15 (= (bvadd (select (select |#memory_int| |~#pstate~0.base|) .cse23) (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (not (= (_ bv1 32) (select .cse22 .cse23)))) (.cse14 (not (= (_ bv1 32) (select .cse22 |~#pstate~0.offset|)))) (.cse5 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse6 (not (= (_ bv0 32) |~#pp~0.offset|)))) (and (or (and .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (and (and .cse7 .cse1) .cse8)) (let ((.cse13 (= |g_#in~pointer.offset| .cse16))) (or (and .cse1 .cse2) .cse9 .cse5 (not (= (_ bv2 32) .cse10)) (and .cse11 .cse12 .cse13) (and .cse1 .cse11) .cse14 .cse4 (and .cse15 .cse13 .cse2) .cse6)) (let ((.cse17 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|))) (or .cse9 (and .cse11 .cse12) (not (= |g_#in~pointer.base| .cse17)) .cse18 .cse19 .cse5 (not (= .cse17 (_ bv0 32))) .cse2 (and .cse1 .cse7 (= g_~pointer.base .cse17) .cse8) .cse14 .cse6 .cse20 .cse21)) (or (and .cse1 .cse7 .cse8) .cse3 .cse2 .cse18 (and .cse12 .cse1 (= (_ bv2 32) g_~pointer.offset)) .cse19 .cse5 .cse6 .cse21) (or .cse2 (and .cse7 .cse1 .cse8) (and .cse0 .cse15) .cse4 .cse14 .cse5 (forall ((|f_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (not (= (bvadd (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |f_write~$Pointer$_#ptr.offset|) (_ bv4294967294 32)) (_ bv0 32)))) .cse6)))))) [2018-10-26 22:57:10,133 INFO L425 ceAbstractionStarter]: For program point L36-5(lines 34 43) no Hoare annotation was computed. [2018-10-26 22:57:10,133 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 34 43) no Hoare annotation was computed. [2018-10-26 22:57:10,133 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-10-26 22:57:10,133 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-10-26 22:57:10,133 INFO L421 ceAbstractionStarter]: At program point L39-2(line 39) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse10 (select .cse12 (bvadd |~#pp~0.offset| (_ bv4 32)))) (.cse8 (not (= (bvadd (select .cse12 |~#pp~0.offset|) (_ bv4294967295 32)) (_ bv0 32)))) (.cse11 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse1 (not (= (_ bv1 32) (select .cse11 (bvadd |~#pstate~0.offset| (_ bv4 32)))))) (.cse5 (not (= (_ bv1 32) (select .cse11 |~#pstate~0.offset|)))) (.cse0 (or (not (= (_ bv2 32) |g_#in~pointer.offset|)) .cse8)) (.cse6 (= ~counter~0 .cse10)) (.cse7 (not (= (_ bv0 32) .cse10))) (.cse2 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse3 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse9 (= (bvadd ~counter~0 (_ bv1 32)) .cse10))) (and (or .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|))) (or (not (= .cse4 (_ bv0 32))) (not (= (_ bv1 32) |g_#in~pointer.offset|)) (not (= |g_#in~pointer.base| .cse4)) .cse5 .cse6 .cse7 .cse2 .cse3 .cse8 .cse9)) (or .cse1 .cse5 .cse2 (forall ((|f_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (not (= (bvadd (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |f_write~$Pointer$_#ptr.offset|) (_ bv4294967294 32)) (_ bv0 32)))) .cse3) (or .cse0 .cse6 .cse7 .cse2 .cse3 .cse9))))) [2018-10-26 22:57:10,133 INFO L421 ceAbstractionStarter]: At program point gENTRY(lines 34 43) the Hoare annotation is: (let ((.cse16 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse14 (select .cse16 |~#pp~0.offset|))) (let ((.cse12 (select .cse16 (bvadd |~#pp~0.offset| (_ bv4 32)))) (.cse10 (not (= (bvadd .cse14 (_ bv4294967295 32)) (_ bv0 32)))) (.cse13 (= (_ bv2 32) |g_#in~pointer.offset|)) (.cse0 (= |old(#memory_int)| |#memory_int|)) (.cse15 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse1 (not (= (_ bv1 32) (select .cse15 (bvadd |~#pstate~0.offset| (_ bv4 32)))))) (.cse2 (not (= (_ bv1 32) (select .cse15 |~#pstate~0.offset|)))) (.cse6 (and (= (_ bv1 32) .cse14) .cse13 .cse0)) (.cse5 (or (not .cse13) .cse10)) (.cse8 (= ~counter~0 .cse12)) (.cse9 (not (= (_ bv0 32) .cse12))) (.cse3 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse4 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse11 (= (bvadd ~counter~0 (_ bv1 32)) .cse12))) (and (or .cse0 .cse1 .cse2 .cse3 (forall ((|f_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (not (= (bvadd (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |f_write~$Pointer$_#ptr.offset|) (_ bv4294967294 32)) (_ bv0 32)))) .cse4) (or .cse5 .cse1 .cse6 .cse3 .cse4) (let ((.cse7 (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|))) (or (not (= (_ bv1 32) |g_#in~pointer.offset|)) .cse0 (not (= |g_#in~pointer.base| .cse7)) .cse8 .cse9 .cse3 (not (= .cse7 (_ bv0 32))) .cse2 .cse4 .cse10 .cse11)) (or .cse6 .cse5 .cse8 .cse9 .cse3 .cse4 .cse11)))))) [2018-10-26 22:57:10,133 INFO L425 ceAbstractionStarter]: For program point L39-3(line 39) no Hoare annotation was computed. [2018-10-26 22:57:10,134 INFO L425 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-10-26 22:57:10,134 INFO L425 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-10-26 22:57:10,134 INFO L425 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-10-26 22:57:10,134 INFO L428 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-10-26 22:57:10,134 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 22:57:10,134 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= |~#pstate~0.offset| (_ bv0 32)) (= (_ bv0 32) (select .cse0 |~#pp~0.offset|)) (= (_ bv0 32) |~#pp~0.offset|) (= (_ bv0 32) (select .cse0 (bvadd |~#pp~0.offset| (_ bv4 32)))) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)))) [2018-10-26 22:57:10,134 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 22:57:10,134 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 22:57:10,134 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-26 22:57:10,135 INFO L421 ceAbstractionStarter]: At program point L62(line 62) the Hoare annotation is: (let ((.cse11 (select |#memory_int| |~#pstate~0.base|)) (.cse1 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse7 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse8 (not (= main_~a~0.offset ~counter~0))) (.cse0 (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|)) (.cse6 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse9 (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32))) (.cse10 (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= (_ bv0 32) main_~a~0.base))) (let ((.cse3 (and .cse8 (= (_ bv0 32) .cse0) (= (_ bv1 32) (select .cse6 |~#pp~0.offset|)) .cse9 .cse10 .cse12)) (.cse5 (select .cse1 .cse7)) (.cse2 (= (bvadd (select .cse11 (bvadd |~#pstate~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))) (or (not (= .cse0 (_ bv0 32))) (not (= (select .cse1 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and .cse2 .cse3) (let ((.cse4 (select .cse6 .cse7))) (and (= (_ bv0 32) main_~b~0.base) (not (= ~counter~0 .cse4)) .cse3 (not (= (bvadd ~counter~0 (_ bv1 32)) .cse4)) (= .cse5 .cse4))) (not (= (_ bv0 32) .cse5)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (and .cse8 .cse2 (exists ((|f_write~$Pointer$_#ptr.offset| (_ BitVec 32))) (= main_~b~0.offset (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |f_write~$Pointer$_#ptr.offset|))) .cse9 .cse10 (= (_ bv1 32) (select .cse11 |~#pstate~0.offset|)) .cse12) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-10-26 22:57:10,135 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 51 69) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (not (= (_ bv0 32) (select .cse0 (bvadd |~#pp~0.offset| (_ bv4 32))))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)))) [2018-10-26 22:57:10,135 INFO L421 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse8 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse10 (bvadd |~#pp~0.offset| (_ bv4 32))) (.cse3 (select |#memory_int| |~#pstate~0.base|))) (let ((.cse1 (not (= main_~a~0.offset ~counter~0))) (.cse4 (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32))) (.cse5 (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (= (_ bv1 32) (select .cse3 |~#pstate~0.offset|))) (.cse2 (select .cse8 .cse10)) (.cse7 (= (_ bv0 32) main_~a~0.base)) (.cse9 (select .cse0 .cse10))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 (= (bvadd .cse2 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select .cse3 (bvadd |~#pstate~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) .cse4 .cse5 .cse6 .cse7) (and .cse1 (= (_ bv0 32) main_~b~0.base) (= main_~a~0.base (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)) .cse4 (= main_~a~0.offset (select .cse8 |~#pp~0.offset|)) .cse5 (= .cse9 .cse2) .cse6 (not (= ~counter~0 .cse2)) (not (= (bvadd ~counter~0 (_ bv1 32)) .cse2)) .cse7) (not (= (_ bv0 32) .cse9)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-10-26 22:57:10,135 INFO L421 ceAbstractionStarter]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse4 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse3 (select .cse0 .cse4))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse2 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse1 (select .cse2 .cse4))) (and (= (_ bv0 32) main_~b~0.base) (not (= ~counter~0 .cse1)) (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32)) (and (not (= main_~a~0.offset ~counter~0)) (= (_ bv0 32) (select .cse2 |~#pp~0.offset|)) (= .cse3 .cse1) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)) (= (_ bv0 32) main_~a~0.base)) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (not (= (bvadd ~counter~0 (_ bv1 32)) .cse1))))) (not (= (_ bv0 32) .cse3)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-10-26 22:57:10,135 INFO L421 ceAbstractionStarter]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse4 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse1 (select .cse0 .cse4))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse3 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse2 (select .cse3 .cse4))) (and (not (= main_~a~0.offset ~counter~0)) (= (_ bv0 32) main_~b~0.base) (= main_~a~0.base (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)) (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= .cse1 .cse2) (= (_ bv1 32) (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|)) (not (= ~counter~0 .cse2)) (= (_ bv1 32) (select .cse3 |~#pp~0.offset|)) (not (= (bvadd ~counter~0 (_ bv1 32)) .cse2)) (= (_ bv0 32) main_~a~0.base)))) (not (= (_ bv0 32) .cse1)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-10-26 22:57:10,135 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2018-10-26 22:57:10,135 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 51 69) no Hoare annotation was computed. [2018-10-26 22:57:10,136 INFO L421 ceAbstractionStarter]: At program point L56(line 56) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse2 (select .cse0 .cse3))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (_ bv0 32) (select .cse1 |~#pp~0.offset|)) (= (bvadd ~counter~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= .cse2 (select .cse1 .cse3)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)) (= (_ bv0 32) main_~a~0.base))) (not (= (_ bv0 32) .cse2)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-10-26 22:57:10,136 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-26 22:57:10,136 INFO L425 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2018-10-26 22:57:10,136 INFO L421 ceAbstractionStarter]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (not (= (_ bv0 32) (select .cse0 (bvadd |~#pp~0.offset| (_ bv4 32))))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|)))) [2018-10-26 22:57:10,136 INFO L421 ceAbstractionStarter]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse0 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse3 (bvadd |~#pp~0.offset| (_ bv4 32)))) (let ((.cse2 (select .cse0 .cse3))) (or (not (= (select (select |old(#memory_$Pointer$.base)| |~#pp~0.base|) |~#pp~0.offset|) (_ bv0 32))) (not (= (select .cse0 |~#pp~0.offset|) (_ bv0 32))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and (let ((.cse1 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and (= (_ bv0 32) (select .cse1 |~#pp~0.offset|)) (= .cse2 (select .cse1 .cse3)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |~#pp~0.base|) |~#pp~0.offset|)))) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) .cse2)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-10-26 22:57:10,136 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 51 69) no Hoare annotation was computed. [2018-10-26 22:57:10,146 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,149 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,150 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,150 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,150 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,150 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,150 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,151 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,151 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,151 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,151 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,152 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,152 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,152 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,152 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,152 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,152 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,153 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,153 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,153 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,153 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,153 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,154 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,154 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,154 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,158 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,158 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,158 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,159 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,159 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,159 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,159 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,159 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,159 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,160 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,160 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,160 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,160 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,160 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,165 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,165 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,165 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,165 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,166 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,166 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,166 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,166 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,166 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,166 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,166 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,171 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,171 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,173 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,173 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,173 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,173 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,173 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,174 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,174 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,174 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,177 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,178 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,178 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,178 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,178 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,178 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,179 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,179 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,179 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,179 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,180 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,181 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,182 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,182 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,182 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,192 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,192 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,193 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,193 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,193 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,193 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,193 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,194 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,194 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,194 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,194 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,194 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,195 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,195 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,195 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,195 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,195 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,195 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,196 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,196 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,196 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,199 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,199 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,199 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-10-26 22:57:10,200 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,200 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,200 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,201 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,201 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,201 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,201 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,202 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,202 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,202 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,215 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,215 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,215 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,215 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,216 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,216 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,216 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,216 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-10-26 22:57:10,216 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,217 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-10-26 22:57:10,218 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,218 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,218 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,218 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,219 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,219 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,219 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,219 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,219 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,219 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,220 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,220 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,220 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,220 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,220 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,220 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,221 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,221 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,221 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,221 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,221 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,222 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,223 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,224 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,225 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,239 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-10-26 22:57:10,239 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,240 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,241 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,241 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,241 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,241 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,242 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,242 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,242 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,242 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,242 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,243 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,243 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,243 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-10-26 22:57:10,243 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,244 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-10-26 22:57:10,245 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,245 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,245 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,245 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,245 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,246 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,246 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,246 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,246 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,246 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,246 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,247 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,247 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,247 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,247 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,247 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,248 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,248 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,248 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,248 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,248 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,248 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,249 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,249 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,249 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,249 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,249 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,249 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,250 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,258 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,259 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,260 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,261 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,261 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,262 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,262 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,262 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,274 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,275 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,275 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,275 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,275 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,275 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,276 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,276 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,276 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,276 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,277 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,277 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,278 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,278 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,278 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,278 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,278 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,279 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:57:10 BoogieIcfgContainer [2018-10-26 22:57:10,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:57:10,283 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:57:10,283 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:57:10,283 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:57:10,284 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:56:13" (3/4) ... [2018-10-26 22:57:10,296 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 22:57:10,303 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-10-26 22:57:10,303 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure malloc [2018-10-26 22:57:10,303 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 22:57:10,303 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-10-26 22:57:10,303 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-10-26 22:57:10,303 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2018-10-26 22:57:10,304 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 22:57:10,311 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2018-10-26 22:57:10,312 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-10-26 22:57:10,312 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-10-26 22:57:10,312 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-26 22:57:10,334 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || !(~bvadd64(counter, 4294967295bv32) == 0bv32)) || ((0bv32 == #memory_$Pointer$[pp][pp] && 0bv32 == #memory_$Pointer$[pp][pp]) && \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp) [2018-10-26 22:57:10,334 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32)) || counter == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || ~bvadd64(counter, 1bv32) == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) && ((((((((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 2bv32 == i) && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || counter == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && ~bvadd64(i, 4294967295bv32) == 0bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(~bvadd64(\old(#memory_$Pointer$)[pp][pp], 4294967295bv32) == 0bv32)) || ~bvadd64(counter, 1bv32) == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) [2018-10-26 22:57:10,334 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((~bvadd64(i, 4294967295bv32) == 0bv32 && 1bv32 == #memory_$Pointer$[pp][pp]) && 2bv32 == pointer) || (~bvadd64(i, 4294967295bv32) == 0bv32 && (\exists f_write~$Pointer$_#ptr.offset : bv32 :: 2bv32 == #memory_$Pointer$[pp][f_write~$Pointer$_#ptr.offset]))) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) || 2bv32 == i) || !(2bv32 == pointer) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || ((i == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == pointer)) && ((((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 2bv32 == i) || !(1bv32 == pointer)) || !(0bv32 == pstate)) || !(2bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || ((1bv32 == pointer && ~bvadd64(i, 4294967295bv32) == 0bv32) && pointer == #memory_$Pointer$[pp][pp])) || (\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 1bv32 == pointer)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || ((~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(pstate, 4bv32)], 4294967295bv32) == 0bv32 && pointer == #memory_$Pointer$[pp][pp]) && 2bv32 == i)) || !(0bv32 == pp))) && ((((((((((((!(1bv32 == pointer) || (1bv32 == pointer && ~bvadd64(i, 4294967295bv32) == 0bv32)) || !(pointer == #memory_$Pointer$[pp][pp])) || counter == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || !(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(#memory_$Pointer$[pp][pp] == 0bv32)) || 2bv32 == i) || (((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && i == 0bv32) && pointer == #memory_$Pointer$[pp][pp]) && pointer == pointer)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(0bv32 == pp)) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || ~bvadd64(counter, 1bv32) == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && ((((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && i == 0bv32) && pointer == pointer) || !(2bv32 == pointer) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || 2bv32 == i) || counter == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || ((~bvadd64(i, 4294967295bv32) == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && 2bv32 == pointer)) || !(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || ~bvadd64(counter, 1bv32) == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && (((((((2bv32 == i || ((i == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == pointer)) || ((((~bvadd64(i, 4294967295bv32) == 0bv32 && 1bv32 == #memory_$Pointer$[pp][pp]) && 2bv32 == pointer) || (~bvadd64(i, 4294967295bv32) == 0bv32 && (\exists f_write~$Pointer$_#ptr.offset : bv32 :: 2bv32 == #memory_$Pointer$[pp][f_write~$Pointer$_#ptr.offset]))) && ~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(pstate, 4bv32)], 4294967295bv32) == 0bv32)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(0bv32 == pstate)) || (forall f_write~$Pointer$_#ptr.offset : bv32 :: !(~bvadd64(#memory_$Pointer$[pp][f_write~$Pointer$_#ptr.offset], 4294967294bv32) == 0bv32))) || !(0bv32 == pp)) [2018-10-26 22:57:10,357 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d9c0ef58-f946-4f6e-b38b-4a38074c591b/bin-2019/utaipan/witness.graphml [2018-10-26 22:57:10,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:57:10,358 INFO L168 Benchmark]: Toolchain (without parser) took 57622.97 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 418.9 MB). Free memory was 947.9 MB in the beginning and 937.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 429.7 MB. Max. memory is 11.5 GB. [2018-10-26 22:57:10,358 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:57:10,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.51 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 931.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:57:10,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.57 ms. Allocated memory is still 1.0 GB. Free memory is still 931.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:57:10,359 INFO L168 Benchmark]: Boogie Preprocessor took 40.89 ms. Allocated memory is still 1.0 GB. Free memory is still 931.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:57:10,359 INFO L168 Benchmark]: RCFGBuilder took 689.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 931.8 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-10-26 22:57:10,359 INFO L168 Benchmark]: TraceAbstraction took 56498.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 260.0 MB). Free memory was 1.1 GB in the beginning and 937.1 MB in the end (delta: 177.1 MB). Peak memory consumption was 528.3 MB. Max. memory is 11.5 GB. [2018-10-26 22:57:10,360 INFO L168 Benchmark]: Witness Printer took 74.19 ms. Allocated memory is still 1.4 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:57:10,361 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.51 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 931.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.57 ms. Allocated memory is still 1.0 GB. Free memory is still 931.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.89 ms. Allocated memory is still 1.0 GB. Free memory is still 931.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 689.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 931.8 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56498.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 260.0 MB). Free memory was 1.1 GB in the beginning and 937.1 MB in the end (delta: 177.1 MB). Peak memory consumption was 528.3 MB. Max. memory is 11.5 GB. * Witness Printer took 74.19 ms. Allocated memory is still 1.4 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 25]: Loop Invariant [2018-10-26 22:57:10,376 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,376 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,376 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,376 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,376 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,376 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,377 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,377 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,377 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,377 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,377 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,377 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,377 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,378 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,378 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,378 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,378 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,386 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,387 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,389 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,390 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,396 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,396 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,396 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,396 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,397 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,397 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,397 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,397 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,397 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,397 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,397 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,398 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,398 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,398 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,398 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,398 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,407 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,407 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,407 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,408 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,408 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,408 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,408 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,408 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,408 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,409 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,410 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,410 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,410 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,410 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,410 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,414 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,414 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,415 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,416 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,417 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || (((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32)) || counter == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || ~bvadd64(counter, 1bv32) == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) && ((((((((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && pointer == pointer) && \old(#memory_$Pointer$) == #memory_$Pointer$) && i == 0bv32) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 2bv32 == i) && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || counter == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) || ((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && pointer == pointer) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && ~bvadd64(i, 4294967295bv32) == 0bv32) && \old(#memory_$Pointer$) == #memory_$Pointer$)) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || !(~bvadd64(\old(#memory_$Pointer$)[pp][pp], 4294967295bv32) == 0bv32)) || ~bvadd64(counter, 1bv32) == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)]) - InvariantResult [Line: 36]: Loop Invariant [2018-10-26 22:57:10,418 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,418 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-10-26 22:57:10,418 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,419 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,419 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,419 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,419 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,419 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,419 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,420 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,420 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,420 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,420 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,420 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,420 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,420 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,421 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,421 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,421 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-10-26 22:57:10,421 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,421 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-10-26 22:57:10,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,438 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,439 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,439 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,439 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,439 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,439 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,439 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,439 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,440 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,440 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,440 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,440 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,440 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,440 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,440 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,441 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,441 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,441 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,441 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,441 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,441 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,441 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,441 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,442 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,442 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,442 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,442 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,442 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,450 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,450 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,450 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,450 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,450 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,450 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,451 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,451 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,451 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,451 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,451 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,451 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,451 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,451 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,452 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,452 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,453 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,453 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-10-26 22:57:10,453 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,453 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,453 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,453 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,454 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,454 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,454 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,454 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,462 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,463 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,463 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,463 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,463 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,463 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,463 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,463 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,464 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,464 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-10-26 22:57:10,464 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,464 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[f_write~$Pointer$_#ptr.offset,QUANTIFIED] [2018-10-26 22:57:10,465 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,465 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,465 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,465 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,465 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,465 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,466 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,466 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,466 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,466 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,466 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,467 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,467 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,467 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,468 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,469 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,470 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 22:57:10,471 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((~bvadd64(i, 4294967295bv32) == 0bv32 && 1bv32 == #memory_$Pointer$[pp][pp]) && 2bv32 == pointer) || (~bvadd64(i, 4294967295bv32) == 0bv32 && (\exists f_write~$Pointer$_#ptr.offset : bv32 :: 2bv32 == #memory_$Pointer$[pp][f_write~$Pointer$_#ptr.offset]))) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) || 2bv32 == i) || !(2bv32 == pointer) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || ((i == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == pointer)) && ((((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 2bv32 == i) || !(1bv32 == pointer)) || !(0bv32 == pstate)) || !(2bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || ((1bv32 == pointer && ~bvadd64(i, 4294967295bv32) == 0bv32) && pointer == #memory_$Pointer$[pp][pp])) || (\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && 1bv32 == pointer)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || ((~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(pstate, 4bv32)], 4294967295bv32) == 0bv32 && pointer == #memory_$Pointer$[pp][pp]) && 2bv32 == i)) || !(0bv32 == pp))) && ((((((((((((!(1bv32 == pointer) || (1bv32 == pointer && ~bvadd64(i, 4294967295bv32) == 0bv32)) || !(pointer == #memory_$Pointer$[pp][pp])) || counter == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || !(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(#memory_$Pointer$[pp][pp] == 0bv32)) || 2bv32 == i) || (((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && i == 0bv32) && pointer == #memory_$Pointer$[pp][pp]) && pointer == pointer)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(0bv32 == pp)) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || ~bvadd64(counter, 1bv32) == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && ((((((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && i == 0bv32) && pointer == pointer) || !(2bv32 == pointer) || !(~bvadd64(#memory_$Pointer$[pp][pp], 4294967295bv32) == 0bv32)) || 2bv32 == i) || counter == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)]) || ((~bvadd64(i, 4294967295bv32) == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && 2bv32 == pointer)) || !(0bv32 == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp)) || ~bvadd64(counter, 1bv32) == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) && (((((((2bv32 == i || ((i == 0bv32 && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && pointer == pointer)) || ((((~bvadd64(i, 4294967295bv32) == 0bv32 && 1bv32 == #memory_$Pointer$[pp][pp]) && 2bv32 == pointer) || (~bvadd64(i, 4294967295bv32) == 0bv32 && (\exists f_write~$Pointer$_#ptr.offset : bv32 :: 2bv32 == #memory_$Pointer$[pp][f_write~$Pointer$_#ptr.offset]))) && ~bvadd64(unknown-#memory_int-unknown[pstate][~bvadd64(pstate, 4bv32)], 4294967295bv32) == 0bv32)) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][~bvadd64(pstate, 4bv32)])) || !(1bv32 == \old(unknown-#memory_int-unknown)[pstate][pstate])) || !(0bv32 == pstate)) || (forall f_write~$Pointer$_#ptr.offset : bv32 :: !(~bvadd64(#memory_$Pointer$[pp][f_write~$Pointer$_#ptr.offset], 4294967294bv32) == 0bv32))) || !(0bv32 == pp)) - InvariantResult [Line: 17]: Loop Invariant [2018-10-26 22:57:10,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,484 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,485 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,485 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,486 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,486 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,486 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 22:57:10,486 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,486 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,486 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 22:57:10,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,486 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 22:57:10,487 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((!(\old(#memory_$Pointer$)[pp][pp] == 0bv32) || !(\old(#memory_$Pointer$)[pp][pp] == 0bv32)) || !(~bvadd64(counter, 4294967295bv32) == 0bv32)) || ((0bv32 == #memory_$Pointer$[pp][pp] && 0bv32 == #memory_$Pointer$[pp][pp]) && \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)] == #memory_$Pointer$[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == \old(#memory_$Pointer$)[pp][~bvadd64(pp, 4bv32)])) || !(0bv32 == pstate)) || !(0bv32 == pp) - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 51 locations, 1 error locations. SAFE Result, 56.2s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 25.9s AutomataDifference, 0.0s DeadEndRemovalTime, 5.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 658 SDtfs, 1559 SDslu, 2248 SDs, 0 SdLazy, 9762 SolverSat, 935 SolverUnsat, 153 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3117 GetRequests, 2636 SyntacticMatches, 17 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6422 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=6, 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.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 131 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 152 PreInvPairs, 199 NumberOfFragments, 2414 HoareAnnotationTreeSize, 152 FomulaSimplifications, 9405 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 20 FomulaSimplificationsInter, 5940 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 1569 NumberOfCodeBlocks, 1569 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2902 ConstructedInterpolants, 47 QuantifiedInterpolants, 1205220 SizeOfPredicates, 388 NumberOfNonLiveVariables, 7459 ConjunctsInSsa, 556 ConjunctsInUnsatCore, 48 InterpolantComputations, 3 PerfectInterpolantSequences, 939/1500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...