./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed4d18349810257ce078dfe4f08b9b953ed4516f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 14:04:27,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:04:27,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:04:27,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:04:27,287 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:04:27,288 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:04:27,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:04:27,289 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:04:27,291 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:04:27,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:04:27,292 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:04:27,292 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:04:27,293 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:04:27,293 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:04:27,294 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:04:27,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:04:27,295 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:04:27,296 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:04:27,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:04:27,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:04:27,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:04:27,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:04:27,302 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:04:27,302 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:04:27,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:04:27,303 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:04:27,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:04:27,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:04:27,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:04:27,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:04:27,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:04:27,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:04:27,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:04:27,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:04:27,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:04:27,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:04:27,308 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 14:04:27,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:04:27,318 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:04:27,318 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 14:04:27,319 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 14:04:27,319 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 14:04:27,319 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 14:04:27,319 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 14:04:27,319 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:04:27,320 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 14:04:27,320 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:04:27,320 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 14:04:27,320 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:04:27,320 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 14:04:27,320 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 14:04:27,320 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 14:04:27,320 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 14:04:27,320 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 14:04:27,321 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 14:04:27,321 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 14:04:27,321 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:04:27,321 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 14:04:27,321 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 14:04:27,321 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 14:04:27,321 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 14:04:27,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:04:27,322 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 14:04:27,322 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 14:04:27,322 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 14:04:27,322 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 14:04:27,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 14:04:27,322 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_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer 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 -> Automizer 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 -> ed4d18349810257ce078dfe4f08b9b953ed4516f [2018-12-08 14:04:27,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:04:27,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:04:27,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:04:27,354 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:04:27,354 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:04:27,355 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 14:04:27,390 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/data/c43cb742b/0be515ff56f342919f5f23644c58cbcc/FLAGc94957315 [2018-12-08 14:04:27,788 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:04:27,789 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 14:04:27,795 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/data/c43cb742b/0be515ff56f342919f5f23644c58cbcc/FLAGc94957315 [2018-12-08 14:04:28,135 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/data/c43cb742b/0be515ff56f342919f5f23644c58cbcc [2018-12-08 14:04:28,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:04:28,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 14:04:28,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:04:28,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:04:28,153 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:04:28,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:04:28" (1/1) ... [2018-12-08 14:04:28,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b5df9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28, skipping insertion in model container [2018-12-08 14:04:28,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:04:28" (1/1) ... [2018-12-08 14:04:28,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:04:28,180 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:04:28,329 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:04:28,335 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:04:28,401 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:04:28,422 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:04:28,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28 WrapperNode [2018-12-08 14:04:28,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:04:28,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 14:04:28,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 14:04:28,423 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 14:04:28,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28" (1/1) ... [2018-12-08 14:04:28,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28" (1/1) ... [2018-12-08 14:04:28,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 14:04:28,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:04:28,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:04:28,442 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:04:28,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28" (1/1) ... [2018-12-08 14:04:28,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28" (1/1) ... [2018-12-08 14:04:28,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28" (1/1) ... [2018-12-08 14:04:28,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28" (1/1) ... [2018-12-08 14:04:28,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28" (1/1) ... [2018-12-08 14:04:28,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28" (1/1) ... [2018-12-08 14:04:28,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28" (1/1) ... [2018-12-08 14:04:28,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:04:28,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:04:28,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:04:28,462 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:04:28,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/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-12-08 14:04:28,495 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-12-08 14:04:28,495 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-12-08 14:04:28,495 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-08 14:04:28,495 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-08 14:04:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 14:04:28,496 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 14:04:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 14:04:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 14:04:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-12-08 14:04:28,496 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-12-08 14:04:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 14:04:28,496 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-08 14:04:28,496 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-08 14:04:28,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 14:04:28,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 14:04:28,497 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 14:04:28,497 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 14:04:28,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 14:04:28,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 14:04:28,497 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-12-08 14:04:28,497 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-12-08 14:04:28,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 14:04:28,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:04:28,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:04:28,707 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:04:28,708 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-08 14:04:28,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:04:28 BoogieIcfgContainer [2018-12-08 14:04:28,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:04:28,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 14:04:28,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 14:04:28,711 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 14:04:28,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 02:04:28" (1/3) ... [2018-12-08 14:04:28,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e66e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:04:28, skipping insertion in model container [2018-12-08 14:04:28,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:04:28" (2/3) ... [2018-12-08 14:04:28,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e66e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:04:28, skipping insertion in model container [2018-12-08 14:04:28,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:04:28" (3/3) ... [2018-12-08 14:04:28,714 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 14:04:28,721 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 14:04:28,726 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 14:04:28,734 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 14:04:28,750 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 14:04:28,751 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 14:04:28,751 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 14:04:28,751 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 14:04:28,751 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 14:04:28,751 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 14:04:28,751 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 14:04:28,752 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 14:04:28,752 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 14:04:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-12-08 14:04:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 14:04:28,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:28,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:04:28,767 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:28,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:28,770 INFO L82 PathProgramCache]: Analyzing trace with hash 813625813, now seen corresponding path program 1 times [2018-12-08 14:04:28,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:28,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:28,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:28,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:28,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:04:28,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:04:28,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:04:28,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 14:04:28,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 14:04:28,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 14:04:28,877 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-12-08 14:04:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:28,891 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2018-12-08 14:04:28,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 14:04:28,892 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-12-08 14:04:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:28,897 INFO L225 Difference]: With dead ends: 97 [2018-12-08 14:04:28,897 INFO L226 Difference]: Without dead ends: 45 [2018-12-08 14:04:28,899 INFO L631 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-12-08 14:04:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-08 14:04:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-08 14:04:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 14:04:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-12-08 14:04:28,924 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2018-12-08 14:04:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:28,925 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-12-08 14:04:28,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 14:04:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-12-08 14:04:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 14:04:28,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:28,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:04:28,926 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:28,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:28,927 INFO L82 PathProgramCache]: Analyzing trace with hash 400468936, now seen corresponding path program 1 times [2018-12-08 14:04:28,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:28,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:28,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:28,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:28,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:04:28,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:04:28,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:04:28,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 14:04:28,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 14:04:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 14:04:28,998 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 5 states. [2018-12-08 14:04:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:29,027 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-12-08 14:04:29,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:04:29,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-08 14:04:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:29,028 INFO L225 Difference]: With dead ends: 75 [2018-12-08 14:04:29,028 INFO L226 Difference]: Without dead ends: 50 [2018-12-08 14:04:29,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:04:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-08 14:04:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-12-08 14:04:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-08 14:04:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-08 14:04:29,033 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2018-12-08 14:04:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:29,034 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-08 14:04:29,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 14:04:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-08 14:04:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 14:04:29,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:29,035 INFO L402 BasicCegarLoop]: trace histogram [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-12-08 14:04:29,035 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:29,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1119395132, now seen corresponding path program 1 times [2018-12-08 14:04:29,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:29,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:29,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 14:04:29,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:04:29,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 14:04:29,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 14:04:29,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 14:04:29,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 14:04:29,081 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-12-08 14:04:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:29,116 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-12-08 14:04:29,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 14:04:29,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-08 14:04:29,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:29,117 INFO L225 Difference]: With dead ends: 69 [2018-12-08 14:04:29,117 INFO L226 Difference]: Without dead ends: 56 [2018-12-08 14:04:29,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 14:04:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-08 14:04:29,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-12-08 14:04:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-08 14:04:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-12-08 14:04:29,122 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2018-12-08 14:04:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:29,122 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-12-08 14:04:29,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 14:04:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-12-08 14:04:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 14:04:29,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:29,123 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:04:29,123 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:29,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:29,123 INFO L82 PathProgramCache]: Analyzing trace with hash 296923910, now seen corresponding path program 1 times [2018-12-08 14:04:29,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:29,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:29,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:29,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:29,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 14:04:29,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:04:29,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/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-12-08 14:04:29,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:29,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:04:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 14:04:29,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:04:29,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-08 14:04:29,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 14:04:29,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 14:04:29,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:04:29,298 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 7 states. [2018-12-08 14:04:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:29,345 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-12-08 14:04:29,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:04:29,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-12-08 14:04:29,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:29,347 INFO L225 Difference]: With dead ends: 79 [2018-12-08 14:04:29,347 INFO L226 Difference]: Without dead ends: 66 [2018-12-08 14:04:29,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-08 14:04:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-08 14:04:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-12-08 14:04:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-08 14:04:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-08 14:04:29,352 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 50 [2018-12-08 14:04:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:29,352 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-08 14:04:29,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 14:04:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-08 14:04:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 14:04:29,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:29,353 INFO L402 BasicCegarLoop]: trace histogram [2, 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-12-08 14:04:29,353 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:29,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:29,354 INFO L82 PathProgramCache]: Analyzing trace with hash -507027760, now seen corresponding path program 2 times [2018-12-08 14:04:29,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:29,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:29,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:29,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:29,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 14:04:29,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:04:29,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/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-12-08 14:04:29,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 14:04:29,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 14:04:29,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:04:29,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:04:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 14:04:29,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 14:04:29,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-12-08 14:04:29,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 14:04:29,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 14:04:29,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 14:04:29,548 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 9 states. [2018-12-08 14:04:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:29,641 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-12-08 14:04:29,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 14:04:29,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-12-08 14:04:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:29,643 INFO L225 Difference]: With dead ends: 83 [2018-12-08 14:04:29,643 INFO L226 Difference]: Without dead ends: 62 [2018-12-08 14:04:29,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-12-08 14:04:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-08 14:04:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-12-08 14:04:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-08 14:04:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-12-08 14:04:29,651 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 58 [2018-12-08 14:04:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:29,652 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-12-08 14:04:29,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 14:04:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-12-08 14:04:29,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 14:04:29,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:29,653 INFO L402 BasicCegarLoop]: trace histogram [2, 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-12-08 14:04:29,653 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:29,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:29,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1930680310, now seen corresponding path program 1 times [2018-12-08 14:04:29,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:29,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:29,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:29,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:04:29,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:04:30,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:04:30,997 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:04:31,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:31,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:04:31,054 INFO L478 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 6 treesize of output 5 [2018-12-08 14:04:31,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:04:31,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:31,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:31,143 INFO L478 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 11 treesize of output 4 [2018-12-08 14:04:31,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 14:04:31,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 14:04:31,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-08 14:04:31,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-08 14:04:31,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 14:04:31,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-12-08 14:04:31,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,221 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-12-08 14:04:31,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-08 14:04:31,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-12-08 14:04:31,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 25 [2018-12-08 14:04:31,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-12-08 14:04:31,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:31,336 INFO L478 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 39 treesize of output 52 [2018-12-08 14:04:31,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:31,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:46 [2018-12-08 14:04:31,594 INFO L478 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-12-08 14:04:31,596 INFO L478 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-12-08 14:04:31,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-08 14:04:31,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-08 14:04:31,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:31,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:31,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:31,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-12-08 14:04:31,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:31,665 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-12-08 14:04:31,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:52 [2018-12-08 14:04:32,271 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data Int) (dll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (+ dll_circular_update_at_~head.offset 8) dll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2018-12-08 14:04:32,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:32,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2018-12-08 14:04:32,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:32,282 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-12-08 14:04:32,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:32,290 INFO L478 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-12-08 14:04:32,290 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:32,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:32,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-08 14:04:32,303 INFO L478 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-12-08 14:04:32,303 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:32,306 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:32,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:32,311 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:73, output treesize:16 [2018-12-08 14:04:32,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-12-08 14:04:32,583 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-08 14:04:32,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:32,592 INFO L478 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-12-08 14:04:32,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:32,603 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:32,604 INFO L478 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 29 treesize of output 10 [2018-12-08 14:04:32,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:32,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:32,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:32,611 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:43, output treesize:10 [2018-12-08 14:04:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-08 14:04:32,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:04:32,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33] total 59 [2018-12-08 14:04:32,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-08 14:04:32,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-08 14:04:32,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=3153, Unknown=1, NotChecked=112, Total=3422 [2018-12-08 14:04:32,680 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 59 states. [2018-12-08 14:04:36,831 WARN L180 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-12-08 14:04:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:40,937 INFO L93 Difference]: Finished difference Result 131 states and 171 transitions. [2018-12-08 14:04:40,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-08 14:04:40,938 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-08 14:04:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:40,939 INFO L225 Difference]: With dead ends: 131 [2018-12-08 14:04:40,939 INFO L226 Difference]: Without dead ends: 128 [2018-12-08 14:04:40,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1715 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=541, Invalid=8763, Unknown=12, NotChecked=190, Total=9506 [2018-12-08 14:04:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-08 14:04:40,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 109. [2018-12-08 14:04:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-08 14:04:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 142 transitions. [2018-12-08 14:04:40,952 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 142 transitions. Word has length 59 [2018-12-08 14:04:40,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:40,953 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 142 transitions. [2018-12-08 14:04:40,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-08 14:04:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 142 transitions. [2018-12-08 14:04:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 14:04:40,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:40,954 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1] [2018-12-08 14:04:40,954 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:40,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:40,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2108590893, now seen corresponding path program 1 times [2018-12-08 14:04:40,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:40,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:40,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:40,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:40,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 14:04:40,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:04:40,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/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-12-08 14:04:40,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:41,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:04:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 14:04:41,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:04:41,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-08 14:04:41,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 14:04:41,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 14:04:41,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 14:04:41,053 INFO L87 Difference]: Start difference. First operand 109 states and 142 transitions. Second operand 8 states. [2018-12-08 14:04:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:41,104 INFO L93 Difference]: Finished difference Result 147 states and 187 transitions. [2018-12-08 14:04:41,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:04:41,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-12-08 14:04:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:41,105 INFO L225 Difference]: With dead ends: 147 [2018-12-08 14:04:41,105 INFO L226 Difference]: Without dead ends: 121 [2018-12-08 14:04:41,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-08 14:04:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-08 14:04:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2018-12-08 14:04:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-08 14:04:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2018-12-08 14:04:41,117 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 149 transitions. Word has length 60 [2018-12-08 14:04:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:41,118 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 149 transitions. [2018-12-08 14:04:41,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 14:04:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 149 transitions. [2018-12-08 14:04:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 14:04:41,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:41,119 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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-12-08 14:04:41,119 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:41,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash 190219152, now seen corresponding path program 2 times [2018-12-08 14:04:41,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:41,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:41,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:41,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:41,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 14:04:41,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:04:41,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 14:04:41,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 14:04:41,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 14:04:41,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:04:41,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:04:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 14:04:41,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:04:41,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-08 14:04:41,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 14:04:41,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 14:04:41,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 14:04:41,256 INFO L87 Difference]: Start difference. First operand 115 states and 149 transitions. Second operand 8 states. [2018-12-08 14:04:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:41,316 INFO L93 Difference]: Finished difference Result 160 states and 200 transitions. [2018-12-08 14:04:41,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 14:04:41,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-12-08 14:04:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:41,318 INFO L225 Difference]: With dead ends: 160 [2018-12-08 14:04:41,318 INFO L226 Difference]: Without dead ends: 119 [2018-12-08 14:04:41,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-08 14:04:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-08 14:04:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2018-12-08 14:04:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-08 14:04:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2018-12-08 14:04:41,333 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 60 [2018-12-08 14:04:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:41,333 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2018-12-08 14:04:41,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 14:04:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2018-12-08 14:04:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 14:04:41,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:41,334 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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-12-08 14:04:41,335 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:41,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1621445052, now seen corresponding path program 3 times [2018-12-08 14:04:41,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:41,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:41,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:04:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 14:04:41,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:04:41,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/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-12-08 14:04:41,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 14:04:41,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-08 14:04:41,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:04:41,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:04:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 14:04:41,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:04:41,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-08 14:04:41,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 14:04:41,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 14:04:41,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 14:04:41,720 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand 8 states. [2018-12-08 14:04:41,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:41,768 INFO L93 Difference]: Finished difference Result 150 states and 180 transitions. [2018-12-08 14:04:41,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 14:04:41,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-12-08 14:04:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:41,769 INFO L225 Difference]: With dead ends: 150 [2018-12-08 14:04:41,769 INFO L226 Difference]: Without dead ends: 117 [2018-12-08 14:04:41,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-08 14:04:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-08 14:04:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2018-12-08 14:04:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-08 14:04:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 134 transitions. [2018-12-08 14:04:41,778 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 134 transitions. Word has length 60 [2018-12-08 14:04:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:41,778 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 134 transitions. [2018-12-08 14:04:41,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 14:04:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2018-12-08 14:04:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 14:04:41,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:41,779 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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-12-08 14:04:41,779 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:41,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:41,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1737834758, now seen corresponding path program 4 times [2018-12-08 14:04:41,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:41,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:41,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:04:41,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 14:04:41,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:04:41,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/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-12-08 14:04:41,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 14:04:41,837 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 14:04:41,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:04:41,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:04:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 14:04:41,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 14:04:41,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2018-12-08 14:04:41,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 14:04:41,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 14:04:41,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 14:04:41,910 INFO L87 Difference]: Start difference. First operand 111 states and 134 transitions. Second operand 10 states. [2018-12-08 14:04:41,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:41,964 INFO L93 Difference]: Finished difference Result 171 states and 201 transitions. [2018-12-08 14:04:41,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 14:04:41,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2018-12-08 14:04:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:41,965 INFO L225 Difference]: With dead ends: 171 [2018-12-08 14:04:41,965 INFO L226 Difference]: Without dead ends: 116 [2018-12-08 14:04:41,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-08 14:04:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-08 14:04:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2018-12-08 14:04:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-08 14:04:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2018-12-08 14:04:41,978 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 68 [2018-12-08 14:04:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:41,978 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2018-12-08 14:04:41,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 14:04:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2018-12-08 14:04:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 14:04:41,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:41,979 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-08 14:04:41,979 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:41,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:41,980 INFO L82 PathProgramCache]: Analyzing trace with hash 2144314145, now seen corresponding path program 1 times [2018-12-08 14:04:41,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:41,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:41,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:41,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:04:41,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 14:04:42,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:04:42,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/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-12-08 14:04:42,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:42,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:04:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 14:04:42,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 14:04:42,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-12-08 14:04:42,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 14:04:42,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 14:04:42,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:04:42,084 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 7 states. [2018-12-08 14:04:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:42,129 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2018-12-08 14:04:42,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 14:04:42,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-08 14:04:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:42,130 INFO L225 Difference]: With dead ends: 115 [2018-12-08 14:04:42,130 INFO L226 Difference]: Without dead ends: 103 [2018-12-08 14:04:42,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 14:04:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-08 14:04:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-12-08 14:04:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-08 14:04:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-12-08 14:04:42,142 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 69 [2018-12-08 14:04:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:42,142 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-12-08 14:04:42,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 14:04:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-12-08 14:04:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 14:04:42,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:42,143 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2018-12-08 14:04:42,143 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:42,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:42,143 INFO L82 PathProgramCache]: Analyzing trace with hash 792894978, now seen corresponding path program 5 times [2018-12-08 14:04:42,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:42,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:42,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:42,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 14:04:42,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:04:42,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/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-12-08 14:04:42,180 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-08 14:04:42,298 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-12-08 14:04:42,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:04:42,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:04:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 14:04:42,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:04:42,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-08 14:04:42,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 14:04:42,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:04:42,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:04:42,328 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 6 states. [2018-12-08 14:04:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:42,357 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2018-12-08 14:04:42,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:04:42,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-08 14:04:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:42,358 INFO L225 Difference]: With dead ends: 116 [2018-12-08 14:04:42,358 INFO L226 Difference]: Without dead ends: 66 [2018-12-08 14:04:42,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:04:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-08 14:04:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-08 14:04:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-08 14:04:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-12-08 14:04:42,365 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 69 [2018-12-08 14:04:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:42,365 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-12-08 14:04:42,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 14:04:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-12-08 14:04:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 14:04:42,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:42,366 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-08 14:04:42,366 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:42,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:42,366 INFO L82 PathProgramCache]: Analyzing trace with hash 141305186, now seen corresponding path program 1 times [2018-12-08 14:04:42,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:42,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:42,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:42,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:04:42,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 14:04:43,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:04:43,098 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/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-12-08 14:04:43,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:43,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:04:43,168 INFO L478 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 6 treesize of output 5 [2018-12-08 14:04:43,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 14:04:43,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:43,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:43,303 INFO L478 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 11 treesize of output 4 [2018-12-08 14:04:43,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 14:04:43,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 14:04:43,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-12-08 14:04:43,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-08 14:04:43,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 14:04:43,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-12-08 14:04:43,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,378 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-12-08 14:04:43,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-08 14:04:43,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-12-08 14:04:43,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 25 [2018-12-08 14:04:43,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-12-08 14:04:43,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:43,471 INFO L478 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 39 treesize of output 52 [2018-12-08 14:04:43,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:43,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:43,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:46 [2018-12-08 14:04:45,532 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-12-08 14:04:45,686 INFO L478 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 19 treesize of output 16 [2018-12-08 14:04:45,687 INFO L478 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 16 treesize of output 1 [2018-12-08 14:04:45,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:45,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:45,692 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-12-08 14:04:45,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2018-12-08 14:04:46,120 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2018-12-08 14:04:46,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-08 14:04:46,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:46,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:46,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:46,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-12-08 14:04:46,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:46,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:46,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:46,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:43 [2018-12-08 14:04:46,347 INFO L478 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 25 treesize of output 18 [2018-12-08 14:04:46,349 INFO L478 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 18 treesize of output 17 [2018-12-08 14:04:46,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:46,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:46,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:46,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:113 [2018-12-08 14:04:46,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 143 [2018-12-08 14:04:46,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 61 [2018-12-08 14:04:46,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 14:04:46,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 14:04:46,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 103 [2018-12-08 14:04:46,494 INFO L478 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 32 treesize of output 1 [2018-12-08 14:04:46,494 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:46,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:46,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 107 [2018-12-08 14:04:46,506 INFO L478 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 32 treesize of output 1 [2018-12-08 14:04:46,506 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:46,513 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:46,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 14:04:46,531 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:154, output treesize:142 [2018-12-08 14:04:47,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 114 [2018-12-08 14:04:47,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:47,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:47,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 124 [2018-12-08 14:04:47,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 8 xjuncts. [2018-12-08 14:04:47,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:47,332 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 104 [2018-12-08 14:04:47,333 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:47,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 14:04:47,455 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2018-12-08 14:04:47,456 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:47,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 9 xjuncts. [2018-12-08 14:04:47,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 84 [2018-12-08 14:04:47,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2018-12-08 14:04:47,704 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 14:04:47,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-12-08 14:04:47,740 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:47,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-12-08 14:04:47,773 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:47,806 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 14:04:47,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2018-12-08 14:04:47,822 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2018-12-08 14:04:47,823 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 14:04:47,849 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-12-08 14:04:47,849 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:47,874 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-12-08 14:04:47,875 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:47,899 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 14:04:47,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 78 [2018-12-08 14:04:47,906 INFO L478 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 74 treesize of output 68 [2018-12-08 14:04:47,907 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:47,928 INFO L478 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 68 treesize of output 64 [2018-12-08 14:04:47,929 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:47,954 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-12-08 14:04:47,955 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 14:04:47,986 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 14:04:47,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 80 [2018-12-08 14:04:47,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-12-08 14:04:47,995 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,018 INFO L478 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 76 treesize of output 70 [2018-12-08 14:04:48,019 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,041 INFO L478 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 70 treesize of output 66 [2018-12-08 14:04:48,042 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,064 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:04:48,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 68 [2018-12-08 14:04:48,068 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-08 14:04:48,068 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,083 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-12-08 14:04:48,084 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,093 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 78 [2018-12-08 14:04:48,103 INFO L478 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 74 treesize of output 70 [2018-12-08 14:04:48,103 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,126 INFO L478 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 70 treesize of output 64 [2018-12-08 14:04:48,126 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,154 INFO L478 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-12-08 14:04:48,156 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 14:04:48,184 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 14:04:48,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2018-12-08 14:04:48,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2018-12-08 14:04:48,193 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-12-08 14:04:48,223 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-12-08 14:04:48,249 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,272 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:04:48,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 92 [2018-12-08 14:04:48,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2018-12-08 14:04:48,281 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2018-12-08 14:04:48,311 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-12-08 14:04:48,349 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,378 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:04:48,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2018-12-08 14:04:48,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2018-12-08 14:04:48,386 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2018-12-08 14:04:48,412 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-12-08 14:04:48,446 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 14:04:48,471 INFO L267 ElimStorePlain]: Start of recursive call 37: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 14:04:48,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-08 14:04:48,843 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:48,843 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:48,843 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,849 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-12-08 14:04:48,852 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:48,852 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:48,853 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,857 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 76 [2018-12-08 14:04:48,864 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-12-08 14:04:48,865 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,891 INFO L478 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 58 treesize of output 43 [2018-12-08 14:04:48,891 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,917 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:48,917 INFO L478 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 68 treesize of output 39 [2018-12-08 14:04:48,917 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,932 INFO L267 ElimStorePlain]: Start of recursive call 45: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-12-08 14:04:48,938 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-12-08 14:04:48,939 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,973 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:48,973 INFO L478 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 48 treesize of output 19 [2018-12-08 14:04:48,973 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,985 INFO L267 ElimStorePlain]: Start of recursive call 49: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-12-08 14:04:48,988 INFO L478 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 22 treesize of output 7 [2018-12-08 14:04:48,988 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,993 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:48,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-12-08 14:04:48,996 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:48,997 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:48,997 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,005 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-12-08 14:04:49,008 INFO L478 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 22 treesize of output 7 [2018-12-08 14:04:49,008 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,011 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-12-08 14:04:49,015 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:49,016 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:49,016 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,021 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-12-08 14:04:49,024 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:49,025 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:49,025 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,031 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-12-08 14:04:49,033 INFO L478 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 22 treesize of output 7 [2018-12-08 14:04:49,033 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,038 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-12-08 14:04:49,041 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:49,041 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:49,041 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,048 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-12-08 14:04:49,051 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:49,051 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:49,052 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,056 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-08 14:04:49,060 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:49,060 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:49,060 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,066 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-08 14:04:49,069 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:49,069 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:49,070 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,075 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-12-08 14:04:49,083 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:49,083 INFO L478 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 60 treesize of output 31 [2018-12-08 14:04:49,083 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,115 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-12-08 14:04:49,119 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:49,119 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:49,119 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,125 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-08 14:04:49,129 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:49,129 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:49,129 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,138 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-08 14:04:49,141 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:49,141 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:49,142 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,146 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-12-08 14:04:49,150 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:49,150 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:49,150 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,156 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-08 14:04:49,160 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 14:04:49,160 INFO L478 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 36 treesize of output 7 [2018-12-08 14:04:49,160 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,165 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-12-08 14:04:49,168 INFO L478 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 22 treesize of output 7 [2018-12-08 14:04:49,168 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,173 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 14:04:49,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 14:04:49,260 INFO L202 ElimStorePlain]: Needed 85 recursive calls to eliminate 7 variables, input treesize:131, output treesize:21 [2018-12-08 14:04:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-12-08 14:04:49,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:04:49,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 63 [2018-12-08 14:04:49,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-08 14:04:49,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-08 14:04:49,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3601, Unknown=7, NotChecked=120, Total=3906 [2018-12-08 14:04:49,330 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 63 states. [2018-12-08 14:04:56,972 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2018-12-08 14:04:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:04:59,862 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-12-08 14:04:59,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-08 14:04:59,863 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 70 [2018-12-08 14:04:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:04:59,864 INFO L225 Difference]: With dead ends: 116 [2018-12-08 14:04:59,864 INFO L226 Difference]: Without dead ends: 104 [2018-12-08 14:04:59,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2185 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=635, Invalid=10069, Unknown=12, NotChecked=204, Total=10920 [2018-12-08 14:04:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-08 14:04:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 67. [2018-12-08 14:04:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-08 14:04:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-12-08 14:04:59,873 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 70 [2018-12-08 14:04:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:04:59,873 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-12-08 14:04:59,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-08 14:04:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-12-08 14:04:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 14:04:59,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:04:59,874 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-08 14:04:59,874 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 14:04:59,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:04:59,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1822430399, now seen corresponding path program 2 times [2018-12-08 14:04:59,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:04:59,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:04:59,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:59,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:04:59,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:04:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:04:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 14:04:59,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 14:04:59,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/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-12-08 14:04:59,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 14:04:59,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 14:04:59,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 14:04:59,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:04:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 14:04:59,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 14:04:59,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-08 14:04:59,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 14:04:59,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 14:04:59,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 14:04:59,979 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 7 states. [2018-12-08 14:05:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:05:00,015 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-12-08 14:05:00,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 14:05:00,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-08 14:05:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:05:00,015 INFO L225 Difference]: With dead ends: 67 [2018-12-08 14:05:00,015 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 14:05:00,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 14:05:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 14:05:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 14:05:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 14:05:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 14:05:00,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-12-08 14:05:00,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:05:00,017 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:05:00,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 14:05:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 14:05:00,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 14:05:00,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 14:05:00,295 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 41 [2018-12-08 14:05:00,431 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 41 [2018-12-08 14:05:00,531 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 37 [2018-12-08 14:05:00,664 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 47 [2018-12-08 14:05:00,837 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2018-12-08 14:05:00,945 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 52 [2018-12-08 14:05:00,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 14:05:00,947 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-12-08 14:05:00,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 14:05:00,947 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 561 563) the Hoare annotation is: true [2018-12-08 14:05:00,947 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 561 563) no Hoare annotation was computed. [2018-12-08 14:05:00,947 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 561 563) no Hoare annotation was computed. [2018-12-08 14:05:00,947 INFO L451 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2018-12-08 14:05:00,947 INFO L451 ceAbstractionStarter]: At program point dll_circular_destroyENTRY(lines 590 600) the Hoare annotation is: true [2018-12-08 14:05:00,947 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 599) no Hoare annotation was computed. [2018-12-08 14:05:00,947 INFO L451 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2018-12-08 14:05:00,947 INFO L448 ceAbstractionStarter]: For program point L593-3(lines 593 597) no Hoare annotation was computed. [2018-12-08 14:05:00,947 INFO L448 ceAbstractionStarter]: For program point L591-2(lines 590 600) no Hoare annotation was computed. [2018-12-08 14:05:00,947 INFO L448 ceAbstractionStarter]: For program point dll_circular_destroyEXIT(lines 590 600) no Hoare annotation was computed. [2018-12-08 14:05:00,947 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 14:05:00,948 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 14:05:00,948 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 14:05:00,948 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 14:05:00,948 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 615 634) no Hoare annotation was computed. [2018-12-08 14:05:00,948 INFO L448 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-12-08 14:05:00,948 INFO L444 ceAbstractionStarter]: At program point L626(line 626) the Hoare annotation is: (let ((.cse4 (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 8))) (.cse7 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (+ 0 8)))) (let ((.cse0 (= 0 main_~s~0.offset)) (.cse1 (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (.cse2 (<= (* 2 main_~len~0) (+ .cse7 1))) (.cse3 (<= .cse7 (+ main_~len~0 1))) (.cse5 (= main_~len~0 .cse4)) (.cse6 (= main_~len~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 main_~expected~0) .cse5 .cse6 (= main_~i~0 0)) (and (<= (+ main_~i~0 .cse7) (+ main_~expected~0 1)) .cse0 .cse1 (<= main_~expected~0 .cse7) .cse2 (<= 1 main_~i~0) .cse3 .cse5 .cse6)))) [2018-12-08 14:05:00,948 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 632) no Hoare annotation was computed. [2018-12-08 14:05:00,948 INFO L448 ceAbstractionStarter]: For program point L626-1(line 626) no Hoare annotation was computed. [2018-12-08 14:05:00,948 INFO L448 ceAbstractionStarter]: For program point L626-2(lines 626 628) no Hoare annotation was computed. [2018-12-08 14:05:00,948 INFO L444 ceAbstractionStarter]: At program point L622(line 622) the Hoare annotation is: (let ((.cse6 (+ main_~i~0 2))) (let ((.cse5 (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (.cse2 (= 0 main_~s~0.offset)) (.cse3 (<= .cse6 main_~new_data~0)) (.cse4 (not (= main_~s~0.base (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))))) (or (and (and (let ((.cse1 (+ main_~i~0 1)) (.cse0 (select (select |#memory_int| main_~s~0.base) (+ 0 8)))) (and (<= .cse0 .cse1) .cse2 (<= 1 main_~i~0) (<= .cse1 .cse0) .cse3 .cse4)) .cse5 (<= main_~new_data~0 (+ main_~len~0 1))) (<= main_~len~0 2)) (and .cse5 (and .cse2 (<= main_~new_data~0 .cse6) .cse3 .cse4) (= main_~len~0 2) (= main_~i~0 0))))) [2018-12-08 14:05:00,948 INFO L448 ceAbstractionStarter]: For program point L624-2(lines 624 629) no Hoare annotation was computed. [2018-12-08 14:05:00,948 INFO L448 ceAbstractionStarter]: For program point L622-1(lines 620 623) no Hoare annotation was computed. [2018-12-08 14:05:00,948 INFO L444 ceAbstractionStarter]: At program point L624-3(lines 624 629) the Hoare annotation is: (let ((.cse0 (<= 2 main_~len~0))) (or (and (<= 2 main_~i~0) (<= main_~len~0 2) .cse0) (let ((.cse1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (+ 0 8)))) (and (<= (* 2 main_~len~0) (+ .cse1 1)) (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset)) (<= .cse1 (+ main_~len~0 1)) (and (= 0 main_~s~0.offset) (<= 0 main_~i~0) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 8))) .cse0))))) [2018-12-08 14:05:00,948 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 615 634) no Hoare annotation was computed. [2018-12-08 14:05:00,948 INFO L451 ceAbstractionStarter]: At program point L624-4(lines 624 629) the Hoare annotation is: true [2018-12-08 14:05:00,948 INFO L444 ceAbstractionStarter]: At program point L618(line 618) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= main_~len~0 2) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-08 14:05:00,949 INFO L444 ceAbstractionStarter]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset))) (let ((.cse3 (not (= main_~s~0.base .cse6))) (.cse5 (select |#memory_int| main_~s~0.base)) (.cse7 (+ 0 8)) (.cse2 (= 0 main_~s~0.offset)) (.cse0 (= 0 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (.cse1 (= main_~len~0 2))) (or (and .cse0 .cse1 (and .cse2 .cse3) (= main_~i~0 0)) (let ((.cse4 (select (select |#memory_int| .cse6) .cse7))) (and .cse0 (<= .cse4 (+ main_~len~0 1)) (<= (+ main_~i~0 main_~len~0) (+ .cse4 1)) (and (<= 2 main_~i~0) .cse2 (= main_~len~0 (select .cse5 (+ main_~s~0.offset 8)))) .cse1)) (and (let ((.cse9 (+ main_~i~0 1)) (.cse8 (select .cse5 .cse7))) (and (<= .cse8 .cse9) (<= .cse9 .cse8) .cse3 (<= main_~i~0 1))) .cse2 (<= 1 main_~i~0) .cse0 .cse1)))) [2018-12-08 14:05:00,949 INFO L448 ceAbstractionStarter]: For program point L618-1(line 618) no Hoare annotation was computed. [2018-12-08 14:05:00,949 INFO L448 ceAbstractionStarter]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2018-12-08 14:05:00,949 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 615 634) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-08 14:05:00,949 INFO L444 ceAbstractionStarter]: At program point L627(lines 615 634) the Hoare annotation is: false [2018-12-08 14:05:00,949 INFO L444 ceAbstractionStarter]: At program point L609-2(lines 609 612) the Hoare annotation is: (let ((.cse7 (<= (+ dll_circular_update_at_~index 1) |dll_circular_update_at_#in~index|)) (.cse5 (= |#memory_int| |old(#memory_int)|)) (.cse6 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))) (let ((.cse0 (<= dll_circular_update_at_~data |dll_circular_update_at_#in~data|)) (.cse4 (<= |dll_circular_update_at_#in~index| dll_circular_update_at_~index)) (.cse1 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse2 (<= |dll_circular_update_at_#in~data| dll_circular_update_at_~data)) (.cse3 (and .cse7 (<= 2 |dll_circular_update_at_#in~index|) .cse5 .cse6))) (and (or (and .cse0 (= (select (select |#memory_$Pointer$.offset| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.offset) .cse1 .cse2) .cse3 .cse4) (or (and (= dll_circular_update_at_~head.base |dll_circular_update_at_#in~head.base|) (<= dll_circular_update_at_~index |dll_circular_update_at_#in~index|) .cse0 .cse5 .cse6 .cse4 (= dll_circular_update_at_~head.offset |dll_circular_update_at_#in~head.offset|) .cse1 .cse2) .cse3 (and .cse7 (= (select (select |#memory_$Pointer$.base| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.base) (<= 1 |dll_circular_update_at_#in~index|) .cse5 .cse6))))) [2018-12-08 14:05:00,949 INFO L448 ceAbstractionStarter]: For program point L609-3(lines 609 612) no Hoare annotation was computed. [2018-12-08 14:05:00,949 INFO L448 ceAbstractionStarter]: For program point dll_circular_update_atFINAL(lines 608 614) no Hoare annotation was computed. [2018-12-08 14:05:00,949 INFO L448 ceAbstractionStarter]: For program point dll_circular_update_atEXIT(lines 608 614) no Hoare annotation was computed. [2018-12-08 14:05:00,949 INFO L444 ceAbstractionStarter]: At program point dll_circular_update_atENTRY(lines 608 614) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-08 14:05:00,949 INFO L448 ceAbstractionStarter]: For program point L578-1(line 578) no Hoare annotation was computed. [2018-12-08 14:05:00,949 INFO L444 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (and (<= |dll_circular_create_#in~len| dll_circular_create_~len) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= dll_circular_create_~len |dll_circular_create_#in~len|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-08 14:05:00,949 INFO L444 ceAbstractionStarter]: At program point L577-2(lines 577 585) the Hoare annotation is: (let ((.cse0 (<= (+ dll_circular_create_~len 1) |dll_circular_create_#in~len|)) (.cse1 (= 0 dll_circular_create_~head~0.offset))) (or (and .cse0 (<= 3 |dll_circular_create_#in~len|)) (and (<= |dll_circular_create_#in~len| dll_circular_create_~len) (= (select |#valid| dll_circular_create_~last~0.base) 1) .cse1 (<= dll_circular_create_~len |dll_circular_create_#in~len|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (let ((.cse2 (+ dll_circular_create_~head~0.offset 4))) (and (= 0 (select (select |#memory_$Pointer$.offset| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) .cse0 (= 0 (select (store (select (store |#memory_$Pointer$.offset| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.offset| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.offset)) dll_circular_create_~head~0.base) .cse2 dll_circular_create_~last~0.offset) dll_circular_create_~head~0.offset)) (= dll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) .cse1 (= 0 dll_circular_create_~new_head~0.offset) (not (= dll_circular_create_~head~0.base (select (store (select (store |#memory_$Pointer$.base| dll_circular_create_~last~0.base (store (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) dll_circular_create_~last~0.offset dll_circular_create_~head~0.base)) dll_circular_create_~head~0.base) .cse2 dll_circular_create_~last~0.base) dll_circular_create_~head~0.offset))) (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)))))) [2018-12-08 14:05:00,949 INFO L448 ceAbstractionStarter]: For program point dll_circular_createEXIT(lines 574 589) no Hoare annotation was computed. [2018-12-08 14:05:00,949 INFO L448 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-12-08 14:05:00,949 INFO L448 ceAbstractionStarter]: For program point L577-3(lines 577 585) no Hoare annotation was computed. [2018-12-08 14:05:00,949 INFO L448 ceAbstractionStarter]: For program point dll_circular_createFINAL(lines 574 589) no Hoare annotation was computed. [2018-12-08 14:05:00,949 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 582) no Hoare annotation was computed. [2018-12-08 14:05:00,950 INFO L444 ceAbstractionStarter]: At program point dll_circular_createENTRY(lines 574 589) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-08 14:05:00,950 INFO L444 ceAbstractionStarter]: At program point L578(line 578) the Hoare annotation is: (or (and (<= (+ dll_circular_create_~len 1) |dll_circular_create_#in~len|) (<= 3 |dll_circular_create_#in~len|)) (and (= (select |#valid| dll_circular_create_~last~0.base) 1) (= 0 dll_circular_create_~head~0.offset) (<= dll_circular_create_~len |dll_circular_create_#in~len|) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))) [2018-12-08 14:05:00,950 INFO L448 ceAbstractionStarter]: For program point L580-2(lines 580 582) no Hoare annotation was computed. [2018-12-08 14:05:00,950 INFO L444 ceAbstractionStarter]: At program point node_createENTRY(lines 564 573) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-12-08 14:05:00,950 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2018-12-08 14:05:00,950 INFO L451 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-12-08 14:05:00,950 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-12-08 14:05:00,950 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2018-12-08 14:05:00,950 INFO L448 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-12-08 14:05:00,950 INFO L448 ceAbstractionStarter]: For program point dll_circular_get_data_atFINAL(lines 601 607) no Hoare annotation was computed. [2018-12-08 14:05:00,950 INFO L448 ceAbstractionStarter]: For program point dll_circular_get_data_atEXIT(lines 601 607) no Hoare annotation was computed. [2018-12-08 14:05:00,950 INFO L451 ceAbstractionStarter]: At program point dll_circular_get_data_atENTRY(lines 601 607) the Hoare annotation is: true [2018-12-08 14:05:00,950 INFO L444 ceAbstractionStarter]: At program point L602-2(lines 602 605) the Hoare annotation is: (let ((.cse0 (forall ((v_main_~s~0.offset_BEFORE_CALL_3 Int) (v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse3 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (+ v_main_~s~0.offset_BEFORE_CALL_3 8)))) (or (< .cse3 2) (< 2 .cse3))))) (.cse1 (or (= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index) (= dll_circular_get_data_at_~index 0)))) (and (or .cse0 (and (<= dll_circular_get_data_at_~index |dll_circular_get_data_at_#in~index|) .cse1) (<= 1 |dll_circular_get_data_at_#in~index|)) (let ((.cse2 (<= (+ dll_circular_get_data_at_~index 1) |dll_circular_get_data_at_#in~index|))) (or (and (and (= (select (select |#memory_$Pointer$.offset| |dll_circular_get_data_at_#in~head.base|) |dll_circular_get_data_at_#in~head.offset|) dll_circular_get_data_at_~head.offset) (or (= dll_circular_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |dll_circular_get_data_at_#in~head.base|) |dll_circular_get_data_at_#in~head.offset|)) (not (= dll_circular_get_data_at_~head.offset 0)))) .cse2) .cse0 (and (<= 2 |dll_circular_get_data_at_#in~index|) .cse2) (and (<= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index) (= |dll_circular_get_data_at_#in~head.base| dll_circular_get_data_at_~head.base) .cse1 (= dll_circular_get_data_at_~head.offset |dll_circular_get_data_at_#in~head.offset|)))))) [2018-12-08 14:05:00,950 INFO L448 ceAbstractionStarter]: For program point L602-3(lines 602 605) no Hoare annotation was computed. [2018-12-08 14:05:00,955 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,956 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,958 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,958 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,959 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,960 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,962 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,962 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,962 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,964 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,967 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,967 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,967 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,967 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,967 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,969 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,969 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,970 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,970 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,970 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,970 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,970 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,973 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,973 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,975 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,975 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:00,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,976 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,978 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,980 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,981 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,981 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:00,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:00,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:00,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:00,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 02:05:00 BoogieIcfgContainer [2018-12-08 14:05:00,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 14:05:00,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 14:05:00,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 14:05:00,984 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 14:05:00,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:04:28" (3/4) ... [2018-12-08 14:05:00,987 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 14:05:00,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 14:05:00,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-08 14:05:00,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2018-12-08 14:05:00,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 14:05:00,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2018-12-08 14:05:00,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2018-12-08 14:05:00,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-08 14:05:00,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2018-12-08 14:05:00,994 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-08 14:05:00,994 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-08 14:05:00,995 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 14:05:01,011 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((len + 1 <= \old(len) && 3 <= \old(len)) || ((((\old(len) <= len && \valid[last] == 1) && 0 == head) && len <= \old(len)) && head == last)) || (((((((0 == #memory_$Pointer$[new_head][new_head] && len + 1 <= \old(len)) && 0 == #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head + 4 := last][head]) && last == #memory_$Pointer$[new_head][new_head]) && 0 == head) && 0 == new_head) && !(head == #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head + 4 := last][head])) && !(new_head == last)) [2018-12-08 14:05:01,011 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((data <= \old(data) && #memory_$Pointer$[head][head] == head) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(data) <= data) || (((index + 1 <= \old(index) && 2 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || \old(index) <= index) && ((((((((((head == head && index <= \old(index)) && data <= \old(data)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(index) <= index) && head == head) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(data) <= data) || (((index + 1 <= \old(index) && 2 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || ((((index + 1 <= \old(index) && #memory_$Pointer$[head][head] == head) && 1 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) [2018-12-08 14:05:01,011 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3 + 8] < 2 || 2 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3 + 8]) || (index <= \old(index) && (\old(index) == index || index == 0))) || 1 <= \old(index)) && (((((#memory_$Pointer$[head][head] == head && (head == #memory_$Pointer$[head][head] || !(head == 0))) && index + 1 <= \old(index)) || (forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3 + 8] < 2 || 2 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3 + 8])) || (2 <= \old(index) && index + 1 <= \old(index))) || (((\old(index) <= index && head == head) && (\old(index) == index || index == 0)) && head == head)) [2018-12-08 14:05:01,025 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2e6378fa-ac39-41b8-b0c0-8e32452c5447/bin-2019/uautomizer/witness.graphml [2018-12-08 14:05:01,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 14:05:01,026 INFO L168 Benchmark]: Toolchain (without parser) took 32883.99 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 423.6 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -263.0 MB). Peak memory consumption was 160.6 MB. Max. memory is 11.5 GB. [2018-12-08 14:05:01,026 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:05:01,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -156.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-08 14:05:01,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:05:01,027 INFO L168 Benchmark]: Boogie Preprocessor took 19.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:05:01,027 INFO L168 Benchmark]: RCFGBuilder took 246.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-08 14:05:01,027 INFO L168 Benchmark]: TraceAbstraction took 32275.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -138.1 MB). Peak memory consumption was 542.9 MB. Max. memory is 11.5 GB. [2018-12-08 14:05:01,027 INFO L168 Benchmark]: Witness Printer took 41.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:05:01,028 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -156.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 246.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32275.09 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 292.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -138.1 MB). Peak memory consumption was 542.9 MB. Max. memory is 11.5 GB. * Witness Printer took 41.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. 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$.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$.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$.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$.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$.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$.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$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,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$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,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$.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$.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$.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$.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$.base * 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_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_$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_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_$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_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_$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_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_$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_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_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_$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_$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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 632]: 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: 609]: Loop Invariant [2018-12-08 14:05:01,032 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,032 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,033 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,033 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,033 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,033 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,033 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,033 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,033 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,033 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,033 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,034 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,034 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,034 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,034 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,037 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,037 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,038 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,038 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,038 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,038 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,038 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,038 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,038 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,039 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,039 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,039 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,039 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,039 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((data <= \old(data) && #memory_$Pointer$[head][head] == head) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(data) <= data) || (((index + 1 <= \old(index) && 2 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || \old(index) <= index) && ((((((((((head == head && index <= \old(index)) && data <= \old(data)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(index) <= index) && head == head) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(data) <= data) || (((index + 1 <= \old(index) && 2 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || ((((index + 1 <= \old(index) && #memory_$Pointer$[head][head] == head) && 1 <= \old(index)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant [2018-12-08 14:05:01,042 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,042 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,042 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,042 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,043 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,043 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,043 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,043 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,043 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,043 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,044 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,045 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,045 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,045 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,045 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,045 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,045 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,045 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,046 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,047 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,047 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,047 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,047 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,047 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((0 == #memory_$Pointer$[s][s] && len == 2) && 0 == s && !(s == #memory_$Pointer$[s][s])) && i == 0) || ((((0 == #memory_$Pointer$[s][s] && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0 + 8] <= len + 1) && i + len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0 + 8] + 1) && (2 <= i && 0 == s) && len == unknown-#memory_int-unknown[s][s + 8]) && len == 2)) || (((((((unknown-#memory_int-unknown[s][0 + 8] <= i + 1 && i + 1 <= unknown-#memory_int-unknown[s][0 + 8]) && !(s == #memory_$Pointer$[s][s])) && i <= 1) && 0 == s) && 1 <= i) && 0 == #memory_$Pointer$[s][s]) && len == 2) - InvariantResult [Line: 602]: Loop Invariant [2018-12-08 14:05:01,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,048 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,048 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,048 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,048 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,048 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,049 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,049 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,049 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,049 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,050 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-12-08 14:05:01,050 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,050 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,050 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,051 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,051 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,051 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3 + 8] < 2 || 2 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3 + 8]) || (index <= \old(index) && (\old(index) == index || index == 0))) || 1 <= \old(index)) && (((((#memory_$Pointer$[head][head] == head && (head == #memory_$Pointer$[head][head] || !(head == 0))) && index + 1 <= \old(index)) || (forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3 + 8] < 2 || 2 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3 + 8])) || (2 <= \old(index) && index + 1 <= \old(index))) || (((\old(index) <= index && head == head) && (\old(index) == index || index == 0)) && head == head)) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 577]: Loop Invariant [2018-12-08 14:05:01,051 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,051 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,051 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,051 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,051 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,051 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,052 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,053 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,053 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,053 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,053 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,053 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,054 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,054 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,054 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((len + 1 <= \old(len) && 3 <= \old(len)) || ((((\old(len) <= len && \valid[last] == 1) && 0 == head) && len <= \old(len)) && head == last)) || (((((((0 == #memory_$Pointer$[new_head][new_head] && len + 1 <= \old(len)) && 0 == #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head + 4 := last][head]) && last == #memory_$Pointer$[new_head][new_head]) && 0 == head) && 0 == new_head) && !(head == #memory_$Pointer$[last := #memory_$Pointer$[last][last := head]][head][head + 4 := last][head])) && !(new_head == last)) - InvariantResult [Line: 624]: Loop Invariant [2018-12-08 14:05:01,054 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,054 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,055 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,055 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,055 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,055 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,055 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,055 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,055 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,056 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,056 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 14:05:01,056 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 14:05:01,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 14:05:01,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 14:05:01,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((2 <= i && len <= 2) && 2 <= len) || (((2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0 + 8] + 1 && 0 == #memory_$Pointer$[s][s]) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][0 + 8] <= len + 1) && ((0 == s && 0 <= i) && len == unknown-#memory_int-unknown[s][s + 8]) && 2 <= len) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 62 locations, 1 error locations. SAFE Result, 32.2s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 19.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 666 SDtfs, 652 SDslu, 2946 SDs, 0 SdLazy, 5038 SolverSat, 417 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 929 GetRequests, 646 SyntacticMatches, 9 SemanticMatches, 274 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3935 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=7, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 134 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 85 PreInvPairs, 120 NumberOfFragments, 896 HoareAnnotationTreeSize, 85 FomulaSimplifications, 4879 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 25 FomulaSimplificationsInter, 3904 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 1494 NumberOfCodeBlocks, 1491 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1469 ConstructedInterpolants, 42 QuantifiedInterpolants, 465487 SizeOfPredicates, 72 NumberOfNonLiveVariables, 3254 ConjunctsInSsa, 246 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 409/534 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...