./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_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_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db17479a00afa98e4ce70a37e790a923b748e4dc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db17479a00afa98e4ce70a37e790a923b748e4dc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 08:52:46,451 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:52:46,452 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:52:46,458 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:52:46,458 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:52:46,459 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:52:46,459 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:52:46,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:52:46,461 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:52:46,461 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:52:46,462 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:52:46,462 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:52:46,462 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:52:46,463 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:52:46,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:52:46,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:52:46,464 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:52:46,465 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:52:46,466 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:52:46,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:52:46,467 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:52:46,468 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:52:46,469 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:52:46,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:52:46,469 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:52:46,470 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:52:46,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:52:46,471 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:52:46,471 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:52:46,472 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:52:46,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:52:46,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:52:46,472 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:52:46,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:52:46,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:52:46,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:52:46,473 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 08:52:46,480 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:52:46,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:52:46,481 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 08:52:46,481 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 08:52:46,481 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 08:52:46,481 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 08:52:46,481 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 08:52:46,481 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 08:52:46,481 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 08:52:46,482 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 08:52:46,482 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 08:52:46,482 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 08:52:46,482 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 08:52:46,482 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:52:46,482 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 08:52:46,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 08:52:46,482 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 08:52:46,482 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:52:46,483 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 08:52:46,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 08:52:46,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 08:52:46,483 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 08:52:46,483 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 08:52:46,483 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 08:52:46,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:52:46,483 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:52:46,483 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 08:52:46,483 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 08:52:46,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 08:52:46,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:52:46,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 08:52:46,484 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 08:52:46,484 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 08:52:46,484 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 08:52:46,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 08:52:46,484 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 08:52:46,484 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db17479a00afa98e4ce70a37e790a923b748e4dc [2018-12-09 08:52:46,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:52:46,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:52:46,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:52:46,512 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:52:46,512 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:52:46,513 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 08:52:46,554 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/data/9af6dabf1/d0083f002cf54a038cd43cbb01deb64b/FLAG0e6d455b5 [2018-12-09 08:52:47,001 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:52:47,001 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 08:52:47,007 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/data/9af6dabf1/d0083f002cf54a038cd43cbb01deb64b/FLAG0e6d455b5 [2018-12-09 08:52:47,015 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/data/9af6dabf1/d0083f002cf54a038cd43cbb01deb64b [2018-12-09 08:52:47,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:52:47,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:52:47,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:52:47,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:52:47,020 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:52:47,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:52:47" (1/1) ... [2018-12-09 08:52:47,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392409d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47, skipping insertion in model container [2018-12-09 08:52:47,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:52:47" (1/1) ... [2018-12-09 08:52:47,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:52:47,050 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:52:47,212 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:52:47,218 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:52:47,284 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:52:47,314 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:52:47,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47 WrapperNode [2018-12-09 08:52:47,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:52:47,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:52:47,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:52:47,315 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:52:47,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47" (1/1) ... [2018-12-09 08:52:47,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47" (1/1) ... [2018-12-09 08:52:47,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:52:47,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:52:47,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:52:47,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:52:47,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47" (1/1) ... [2018-12-09 08:52:47,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47" (1/1) ... [2018-12-09 08:52:47,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47" (1/1) ... [2018-12-09 08:52:47,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47" (1/1) ... [2018-12-09 08:52:47,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47" (1/1) ... [2018-12-09 08:52:47,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47" (1/1) ... [2018-12-09 08:52:47,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47" (1/1) ... [2018-12-09 08:52:47,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:52:47,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:52:47,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:52:47,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:52:47,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 08:52:47,387 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 08:52:47,387 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 08:52:47,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:52:47,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 08:52:47,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 08:52:47,387 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 08:52:47,388 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 08:52:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 08:52:47,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 08:52:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 08:52:47,388 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 08:52:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-12-09 08:52:47,388 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-12-09 08:52:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 08:52:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 08:52:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-09 08:52:47,388 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-09 08:52:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 08:52:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-09 08:52:47,388 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-09 08:52:47,388 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-12-09 08:52:47,389 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-12-09 08:52:47,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:52:47,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:52:47,574 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:52:47,575 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 08:52:47,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:52:47 BoogieIcfgContainer [2018-12-09 08:52:47,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:52:47,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 08:52:47,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 08:52:47,579 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 08:52:47,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:52:47" (1/3) ... [2018-12-09 08:52:47,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8a5fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:52:47, skipping insertion in model container [2018-12-09 08:52:47,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:52:47" (2/3) ... [2018-12-09 08:52:47,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8a5fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:52:47, skipping insertion in model container [2018-12-09 08:52:47,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:52:47" (3/3) ... [2018-12-09 08:52:47,581 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 08:52:47,589 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 08:52:47,596 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 08:52:47,609 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 08:52:47,627 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 08:52:47,627 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 08:52:47,627 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 08:52:47,627 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:52:47,627 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:52:47,627 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 08:52:47,628 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:52:47,628 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 08:52:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-12-09 08:52:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 08:52:47,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:52:47,641 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-09 08:52:47,643 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:52:47,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:52:47,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1072166703, now seen corresponding path program 1 times [2018-12-09 08:52:47,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:52:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:52:47,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:52:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:52:47,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:52:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:52:47,761 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-09 08:52:47,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:52:47,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:52:47,762 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:52:47,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:52:47,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:52:47,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:52:47,775 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-12-09 08:52:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:52:47,823 INFO L93 Difference]: Finished difference Result 105 states and 143 transitions. [2018-12-09 08:52:47,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:52:47,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-09 08:52:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:52:47,832 INFO L225 Difference]: With dead ends: 105 [2018-12-09 08:52:47,832 INFO L226 Difference]: Without dead ends: 53 [2018-12-09 08:52:47,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:52:47,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-09 08:52:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2018-12-09 08:52:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 08:52:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-09 08:52:47,863 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 32 [2018-12-09 08:52:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:52:47,864 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-09 08:52:47,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:52:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-09 08:52:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 08:52:47,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:52:47,865 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:52:47,865 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:52:47,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:52:47,865 INFO L82 PathProgramCache]: Analyzing trace with hash -169920805, now seen corresponding path program 1 times [2018-12-09 08:52:47,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:52:47,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:52:47,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:52:47,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:52:47,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:52:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:52:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 08:52:47,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:52:47,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:52:47,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:52:47,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:52:47,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:52:47,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:52:47,920 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-12-09 08:52:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:52:47,953 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-12-09 08:52:47,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:52:47,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-12-09 08:52:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:52:47,954 INFO L225 Difference]: With dead ends: 73 [2018-12-09 08:52:47,954 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 08:52:47,954 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-09 08:52:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 08:52:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-12-09 08:52:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 08:52:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-09 08:52:47,959 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 40 [2018-12-09 08:52:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:52:47,959 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-09 08:52:47,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:52:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-09 08:52:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 08:52:47,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:52:47,960 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] [2018-12-09 08:52:47,960 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:52:47,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:52:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1184429299, now seen corresponding path program 1 times [2018-12-09 08:52:47,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:52:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:52:47,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:52:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:52:47,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:52:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:52:48,014 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-09 08:52:48,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:52:48,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:52:48,015 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-09 08:52:48,016 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [65], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-09 08:52:48,041 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 08:52:48,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 08:52:48,190 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 08:52:48,191 INFO L272 AbstractInterpreter]: Visited 29 different actions 54 times. Merged at 6 different actions 9 times. Never widened. Performed 559 root evaluator evaluations with a maximum evaluation depth of 4. Performed 559 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-12-09 08:52:48,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:52:48,196 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 08:52:48,257 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 83.36% of their original sizes. [2018-12-09 08:52:48,257 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 08:52:48,411 INFO L418 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-12-09 08:52:48,411 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 08:52:48,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 08:52:48,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 23 [2018-12-09 08:52:48,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:52:48,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 08:52:48,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 08:52:48,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-12-09 08:52:48,413 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 20 states. [2018-12-09 08:52:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:52:49,259 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-12-09 08:52:49,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 08:52:49,259 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-12-09 08:52:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:52:49,260 INFO L225 Difference]: With dead ends: 83 [2018-12-09 08:52:49,260 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 08:52:49,261 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2018-12-09 08:52:49,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 08:52:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2018-12-09 08:52:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 08:52:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-12-09 08:52:49,269 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 48 [2018-12-09 08:52:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:52:49,269 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-12-09 08:52:49,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 08:52:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-12-09 08:52:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 08:52:49,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:52:49,271 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] [2018-12-09 08:52:49,271 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:52:49,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:52:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1965105618, now seen corresponding path program 1 times [2018-12-09 08:52:49,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:52:49,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:52:49,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:52:49,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:52:49,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:52:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:52:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 08:52:49,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:52:49,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:52:49,346 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-12-09 08:52:49,346 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [65], [67], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-09 08:52:49,347 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 08:52:49,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 08:52:49,390 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 08:52:49,390 INFO L272 AbstractInterpreter]: Visited 39 different actions 94 times. Merged at 10 different actions 21 times. Never widened. Performed 811 root evaluator evaluations with a maximum evaluation depth of 4. Performed 811 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 9 fixpoints after 5 different actions. Largest state had 31 variables. [2018-12-09 08:52:49,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:52:49,392 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 08:52:49,419 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 88.49% of their original sizes. [2018-12-09 08:52:49,419 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 08:52:49,536 INFO L418 sIntCurrentIteration]: We unified 48 AI predicates to 48 [2018-12-09 08:52:49,537 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 08:52:49,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 08:52:49,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [5] total 25 [2018-12-09 08:52:49,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:52:49,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 08:52:49,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 08:52:49,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-12-09 08:52:49,537 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 22 states. [2018-12-09 08:52:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:52:50,407 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2018-12-09 08:52:50,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 08:52:50,407 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-12-09 08:52:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:52:50,408 INFO L225 Difference]: With dead ends: 78 [2018-12-09 08:52:50,408 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 08:52:50,409 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-12-09 08:52:50,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 08:52:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-12-09 08:52:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 08:52:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-12-09 08:52:50,417 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 49 [2018-12-09 08:52:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:52:50,417 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-12-09 08:52:50,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 08:52:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-12-09 08:52:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 08:52:50,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:52:50,418 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-09 08:52:50,418 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:52:50,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:52:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1526544909, now seen corresponding path program 1 times [2018-12-09 08:52:50,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:52:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:52:50,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:52:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:52:50,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:52:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:52:50,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 08:52:50,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:52:50,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:52:50,464 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-12-09 08:52:50,464 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [65], [67], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-09 08:52:50,466 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 08:52:50,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 08:52:50,521 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 08:52:50,522 INFO L272 AbstractInterpreter]: Visited 46 different actions 103 times. Merged at 11 different actions 22 times. Never widened. Performed 841 root evaluator evaluations with a maximum evaluation depth of 4. Performed 841 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 6 different actions. Largest state had 31 variables. [2018-12-09 08:52:50,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:52:50,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 08:52:50,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:52:50,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:52:50,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:52:50,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 08:52:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:52:50,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:52:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 08:52:50,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:52:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 08:52:50,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:52:50,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-09 08:52:50,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:52:50,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:52:50,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:52:50,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:52:50,646 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 5 states. [2018-12-09 08:52:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:52:50,691 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-12-09 08:52:50,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:52:50,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 08:52:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:52:50,692 INFO L225 Difference]: With dead ends: 89 [2018-12-09 08:52:50,692 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 08:52:50,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:52:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 08:52:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2018-12-09 08:52:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 08:52:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-12-09 08:52:50,699 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 50 [2018-12-09 08:52:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:52:50,699 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-12-09 08:52:50,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:52:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-12-09 08:52:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 08:52:50,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:52:50,700 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-09 08:52:50,700 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:52:50,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:52:50,700 INFO L82 PathProgramCache]: Analyzing trace with hash 500095555, now seen corresponding path program 2 times [2018-12-09 08:52:50,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:52:50,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:52:50,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:52:50,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:52:50,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:52:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:52:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:52:51,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:52:51,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:52:51,481 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 08:52:51,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 08:52:51,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:52:51,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:52:51,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 08:52:51,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 08:52:51,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 08:52:51,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:52:51,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:52:51,627 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-09 08:52:51,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:51,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:51,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-09 08:52:51,679 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-09 08:52:51,681 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-09 08:52:51,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:51,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:51,689 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-09 08:52:51,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-12-09 08:52:51,850 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-09 08:52:51,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:52:51,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 08:52:51,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:25 [2018-12-09 08:52:52,794 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 08:52:52,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:52,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:52,801 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-09 08:52:52,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,813 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 24 treesize of output 25 [2018-12-09 08:52:52,815 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 08:52:52,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:52,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 08:52:52,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,826 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:24 [2018-12-09 08:52:52,875 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-09 08:52:52,877 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-09 08:52:52,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,889 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-09 08:52:52,890 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 8 treesize of output 7 [2018-12-09 08:52:52,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,902 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 28 [2018-12-09 08:52:52,904 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 12 treesize of output 1 [2018-12-09 08:52:52,904 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,906 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,913 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:55, output treesize:36 [2018-12-09 08:52:52,963 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 85 treesize of output 81 [2018-12-09 08:52:52,965 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 12 treesize of output 11 [2018-12-09 08:52:52,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,990 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 27 treesize of output 28 [2018-12-09 08:52:52,992 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 12 treesize of output 11 [2018-12-09 08:52:52,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:52,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:53,007 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 39 treesize of output 26 [2018-12-09 08:52:53,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:53,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-12-09 08:52:53,013 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:53,016 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:53,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:52:53,024 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:98, output treesize:55 [2018-12-09 08:52:53,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:53,423 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:52:53,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 158 [2018-12-09 08:52:53,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:53,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-12-09 08:52:53,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:53,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:53,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:53,483 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:52:53,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 93 [2018-12-09 08:52:53,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:53,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-12-09 08:52:53,494 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:53,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:53,515 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:52:53,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:53,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-12-09 08:52:53,519 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:52:53,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 42 [2018-12-09 08:52:53,520 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:53,524 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:53,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:52:53,533 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:165, output treesize:68 [2018-12-09 08:52:54,998 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int) (sll_circular_update_at_~data Int)) (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_sll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base|) .cse0 sll_circular_update_at_~data)) |c_#memory_int|)))) is different from true [2018-12-09 08:52:55,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:55,011 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 35 treesize of output 40 [2018-12-09 08:52:55,013 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-09 08:52:55,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:55,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:55,040 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 71 treesize of output 63 [2018-12-09 08:52:55,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:55,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 60 treesize of output 61 [2018-12-09 08:52:55,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:55,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:55,076 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 59 treesize of output 60 [2018-12-09 08:52:55,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:55,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2018-12-09 08:52:55,081 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:55,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:52:55,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:52:55,098 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:122, output treesize:68 [2018-12-09 08:52:55,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 120 treesize of output 136 [2018-12-09 08:52:55,617 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 104 treesize of output 98 [2018-12-09 08:52:55,618 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-09 08:52:55,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:55,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:55,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 90 [2018-12-09 08:52:55,906 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-09 08:52:56,314 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 118 treesize of output 113 [2018-12-09 08:52:56,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:56,523 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 113 treesize of output 101 [2018-12-09 08:52:56,524 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:52:56,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:56,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:52:56,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-12-09 08:52:56,736 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:52:56,950 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 98 treesize of output 90 [2018-12-09 08:52:56,951 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-09 08:52:57,177 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 1 case distinctions, treesize of input 94 treesize of output 92 [2018-12-09 08:52:57,178 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 08:52:57,422 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 88 treesize of output 74 [2018-12-09 08:52:57,423 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:52:57,425 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 81 treesize of output 69 [2018-12-09 08:52:57,430 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:52:57,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 86 [2018-12-09 08:52:57,774 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 08:52:58,042 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 99 [2018-12-09 08:52:58,043 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 08:52:58,328 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 101 [2018-12-09 08:52:58,328 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:52:58,778 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 101 treesize of output 91 [2018-12-09 08:52:58,779 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-09 08:52:59,071 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 101 treesize of output 91 [2018-12-09 08:52:59,072 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-09 08:52:59,349 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 91 treesize of output 86 [2018-12-09 08:52:59,349 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 08:52:59,731 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 110 treesize of output 102 [2018-12-09 08:52:59,732 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:00,301 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 112 treesize of output 104 [2018-12-09 08:53:00,302 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:00,586 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 104 treesize of output 99 [2018-12-09 08:53:00,586 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:00,866 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 102 treesize of output 92 [2018-12-09 08:53:00,867 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-09 08:53:01,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:01,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:01,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2018-12-09 08:53:01,142 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:01,404 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 90 [2018-12-09 08:53:01,405 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 08:53:01,412 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 78 [2018-12-09 08:53:01,413 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 08:53:01,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:01,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:01,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 86 [2018-12-09 08:53:01,729 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:02,043 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 91 treesize of output 86 [2018-12-09 08:53:02,044 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:02,353 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 86 [2018-12-09 08:53:02,354 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-09 08:53:02,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 23 dim-1 vars, End of recursive call: 21 dim-0 vars, and 15 xjuncts. [2018-12-09 08:53:02,993 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2018-12-09 08:53:02,996 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 37 treesize of output 19 [2018-12-09 08:53:02,996 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,004 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 26 treesize of output 11 [2018-12-09 08:53:03,004 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,009 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 104 treesize of output 106 [2018-12-09 08:53:03,024 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 98 treesize of output 85 [2018-12-09 08:53:03,024 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,111 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 85 treesize of output 76 [2018-12-09 08:53:03,111 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,194 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 94 treesize of output 85 [2018-12-09 08:53:03,194 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,276 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 94 treesize of output 81 [2018-12-09 08:53:03,276 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,360 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 80 [2018-12-09 08:53:03,360 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,448 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2018-12-09 08:53:03,448 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,528 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 80 treesize of output 62 [2018-12-09 08:53:03,528 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,642 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 77 treesize of output 68 [2018-12-09 08:53:03,643 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,694 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-12-09 08:53:03,694 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,735 INFO L267 ElimStorePlain]: Start of recursive call 31: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 94 [2018-12-09 08:53:03,746 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 90 treesize of output 81 [2018-12-09 08:53:03,747 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,794 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2018-12-09 08:53:03,794 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,834 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 86 treesize of output 73 [2018-12-09 08:53:03,835 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,867 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2018-12-09 08:53:03,867 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,898 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 71 treesize of output 58 [2018-12-09 08:53:03,899 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,932 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 73 treesize of output 64 [2018-12-09 08:53:03,932 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,963 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-09 08:53:03,963 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,981 INFO L267 ElimStorePlain]: Start of recursive call 41: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:03,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 86 [2018-12-09 08:53:03,987 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 08:53:03,987 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,003 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 21 treesize of output 11 [2018-12-09 08:53:04,003 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,015 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 32 treesize of output 19 [2018-12-09 08:53:04,016 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,026 INFO L267 ElimStorePlain]: Start of recursive call 49: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 100 treesize of output 102 [2018-12-09 08:53:04,040 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 72 [2018-12-09 08:53:04,041 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,118 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 72 treesize of output 63 [2018-12-09 08:53:04,118 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,196 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 94 treesize of output 85 [2018-12-09 08:53:04,197 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,274 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 85 treesize of output 72 [2018-12-09 08:53:04,274 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,347 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-12-09 08:53:04,347 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,418 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 62 [2018-12-09 08:53:04,419 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,485 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 68 [2018-12-09 08:53:04,486 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,550 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-12-09 08:53:04,550 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54 [2018-12-09 08:53:04,604 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,651 INFO L267 ElimStorePlain]: Start of recursive call 53: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 94 [2018-12-09 08:53:04,664 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 86 treesize of output 77 [2018-12-09 08:53:04,664 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,703 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 77 treesize of output 72 [2018-12-09 08:53:04,703 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,743 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 90 treesize of output 77 [2018-12-09 08:53:04,743 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,775 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 72 [2018-12-09 08:53:04,776 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,808 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2018-12-09 08:53:04,809 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,845 INFO L267 ElimStorePlain]: Start of recursive call 63: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 82 [2018-12-09 08:53:04,854 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 74 treesize of output 56 [2018-12-09 08:53:04,855 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,881 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-12-09 08:53:04,881 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,910 INFO L267 ElimStorePlain]: Start of recursive call 69: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 82 [2018-12-09 08:53:04,919 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 78 treesize of output 65 [2018-12-09 08:53:04,919 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,945 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 69 treesize of output 52 [2018-12-09 08:53:04,945 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,970 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-12-09 08:53:04,970 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:04,998 INFO L267 ElimStorePlain]: Start of recursive call 72: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2018-12-09 08:53:05,003 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 47 treesize of output 30 [2018-12-09 08:53:05,003 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,013 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 11 treesize of output 1 [2018-12-09 08:53:05,013 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,019 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 94 [2018-12-09 08:53:05,031 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 90 treesize of output 81 [2018-12-09 08:53:05,031 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,073 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2018-12-09 08:53:05,073 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,108 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 72 [2018-12-09 08:53:05,108 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,140 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 76 treesize of output 63 [2018-12-09 08:53:05,141 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,172 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 72 treesize of output 59 [2018-12-09 08:53:05,173 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,203 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 63 treesize of output 58 [2018-12-09 08:53:05,204 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,231 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 59 treesize of output 54 [2018-12-09 08:53:05,232 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,249 INFO L267 ElimStorePlain]: Start of recursive call 79: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 90 [2018-12-09 08:53:05,258 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 86 treesize of output 77 [2018-12-09 08:53:05,259 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,296 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 67 [2018-12-09 08:53:05,297 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,334 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 67 treesize of output 54 [2018-12-09 08:53:05,334 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,363 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 67 [2018-12-09 08:53:05,363 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,389 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 67 treesize of output 50 [2018-12-09 08:53:05,389 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,407 INFO L267 ElimStorePlain]: Start of recursive call 87: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 86 [2018-12-09 08:53:05,416 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 21 treesize of output 11 [2018-12-09 08:53:05,416 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,432 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 5 treesize of output 1 [2018-12-09 08:53:05,432 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,447 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 32 treesize of output 19 [2018-12-09 08:53:05,447 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,460 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 5 treesize of output 1 [2018-12-09 08:53:05,460 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,475 INFO L267 ElimStorePlain]: Start of recursive call 93: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 76 [2018-12-09 08:53:05,482 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 1 [2018-12-09 08:53:05,482 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,493 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 47 treesize of output 30 [2018-12-09 08:53:05,493 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,501 INFO L267 ElimStorePlain]: Start of recursive call 98: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 104 treesize of output 106 [2018-12-09 08:53:05,516 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 98 treesize of output 85 [2018-12-09 08:53:05,517 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,606 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 80 [2018-12-09 08:53:05,607 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,690 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 94 treesize of output 81 [2018-12-09 08:53:05,691 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,775 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 94 treesize of output 81 [2018-12-09 08:53:05,775 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,859 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 81 treesize of output 67 [2018-12-09 08:53:05,860 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:05,941 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 62 [2018-12-09 08:53:05,941 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,070 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 77 treesize of output 68 [2018-12-09 08:53:06,070 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,123 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-12-09 08:53:06,124 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,175 INFO L267 ElimStorePlain]: Start of recursive call 101: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2018-12-09 08:53:06,187 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 60 [2018-12-09 08:53:06,187 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,215 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 78 treesize of output 73 [2018-12-09 08:53:06,215 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,241 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 56 treesize of output 42 [2018-12-09 08:53:06,241 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,264 INFO L267 ElimStorePlain]: Start of recursive call 110: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 31 [2018-12-09 08:53:06,502 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 24 treesize of output 15 [2018-12-09 08:53:06,502 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,506 INFO L267 ElimStorePlain]: Start of recursive call 114: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 56 [2018-12-09 08:53:06,513 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 52 treesize of output 45 [2018-12-09 08:53:06,514 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,538 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 45 treesize of output 36 [2018-12-09 08:53:06,538 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,560 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 48 treesize of output 39 [2018-12-09 08:53:06,560 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,579 INFO L267 ElimStorePlain]: Start of recursive call 116: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:53:06,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 45 treesize of output 39 [2018-12-09 08:53:06,582 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 24 treesize of output 15 [2018-12-09 08:53:06,582 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,588 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,590 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 54 treesize of output 48 [2018-12-09 08:53:06,591 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 24 treesize of output 15 [2018-12-09 08:53:06,592 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,600 INFO L267 ElimStorePlain]: Start of recursive call 122: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,602 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 0 case distinctions, treesize of input 42 treesize of output 36 [2018-12-09 08:53:06,604 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 15 treesize of output 7 [2018-12-09 08:53:06,604 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,610 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 9 treesize of output 1 [2018-12-09 08:53:06,610 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,618 INFO L267 ElimStorePlain]: Start of recursive call 124: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,620 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-12-09 08:53:06,622 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 9 treesize of output 1 [2018-12-09 08:53:06,622 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,630 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 15 treesize of output 7 [2018-12-09 08:53:06,630 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,632 INFO L267 ElimStorePlain]: Start of recursive call 127: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,634 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-09 08:53:06,635 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 24 treesize of output 15 [2018-12-09 08:53:06,636 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,641 INFO L267 ElimStorePlain]: Start of recursive call 130: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,646 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 1 case distinctions, treesize of input 58 treesize of output 60 [2018-12-09 08:53:06,648 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 52 treesize of output 43 [2018-12-09 08:53:06,649 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,676 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 56 treesize of output 47 [2018-12-09 08:53:06,676 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,701 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 47 treesize of output 40 [2018-12-09 08:53:06,701 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,723 INFO L267 ElimStorePlain]: Start of recursive call 132: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:53:06,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 48 [2018-12-09 08:53:06,728 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 9 treesize of output 1 [2018-12-09 08:53:06,728 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,736 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 15 treesize of output 7 [2018-12-09 08:53:06,736 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,743 INFO L267 ElimStorePlain]: Start of recursive call 136: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,748 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 1 case distinctions, treesize of input 58 treesize of output 60 [2018-12-09 08:53:06,750 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 56 treesize of output 49 [2018-12-09 08:53:06,750 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,776 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 49 treesize of output 40 [2018-12-09 08:53:06,777 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,803 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 52 treesize of output 43 [2018-12-09 08:53:06,803 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,825 INFO L267 ElimStorePlain]: Start of recursive call 139: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:53:06,827 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 50 treesize of output 44 [2018-12-09 08:53:06,828 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 24 treesize of output 15 [2018-12-09 08:53:06,829 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,836 INFO L267 ElimStorePlain]: Start of recursive call 143: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-09 08:53:06,839 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 9 treesize of output 1 [2018-12-09 08:53:06,840 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,848 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 15 treesize of output 7 [2018-12-09 08:53:06,848 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,857 INFO L267 ElimStorePlain]: Start of recursive call 145: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,859 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 0 case distinctions, treesize of input 42 treesize of output 36 [2018-12-09 08:53:06,860 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 9 treesize of output 1 [2018-12-09 08:53:06,860 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,867 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 15 treesize of output 7 [2018-12-09 08:53:06,868 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,872 INFO L267 ElimStorePlain]: Start of recursive call 148: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-09 08:53:06,876 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 9 treesize of output 1 [2018-12-09 08:53:06,876 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,885 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 15 treesize of output 7 [2018-12-09 08:53:06,885 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,898 INFO L267 ElimStorePlain]: Start of recursive call 151: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,900 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 54 treesize of output 48 [2018-12-09 08:53:06,902 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 15 treesize of output 7 [2018-12-09 08:53:06,902 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,911 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 9 treesize of output 1 [2018-12-09 08:53:06,911 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,918 INFO L267 ElimStorePlain]: Start of recursive call 154: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:06,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 08:53:06,986 INFO L202 ElimStorePlain]: Needed 156 recursive calls to eliminate 9 variables, input treesize:153, output treesize:37 [2018-12-09 08:53:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2018-12-09 08:53:07,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:53:07,495 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-09 08:53:07,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:07,528 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-09 08:53:07,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:07,549 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:07,555 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:07,571 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-09 08:53:07,574 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:07,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-12-09 08:53:07,584 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:151, output treesize:91 [2018-12-09 08:53:07,818 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-12-09 08:53:08,781 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-12-09 08:53:08,789 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-12-09 08:53:08,998 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:53:08,999 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-09 08:53:09,005 INFO L168 Benchmark]: Toolchain (without parser) took 21987.32 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 456.1 MB). Free memory was 948.1 MB in the beginning and 1.4 GB in the end (delta: -465.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:53:09,006 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:53:09,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-09 08:53:09,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.35 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-09 08:53:09,007 INFO L168 Benchmark]: Boogie Preprocessor took 20.71 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 08:53:09,008 INFO L168 Benchmark]: RCFGBuilder took 219.70 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: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2018-12-09 08:53:09,009 INFO L168 Benchmark]: TraceAbstraction took 21427.87 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 331.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -341.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:53:09,012 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -160.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.35 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 20.71 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 219.70 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: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21427.87 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 331.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -341.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 08:53:10,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:53:10,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:53:10,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:53:10,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:53:10,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:53:10,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:53:10,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:53:10,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:53:10,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:53:10,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:53:10,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:53:10,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:53:10,274 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:53:10,275 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:53:10,275 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:53:10,276 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:53:10,277 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:53:10,277 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:53:10,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:53:10,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:53:10,279 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:53:10,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:53:10,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:53:10,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:53:10,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:53:10,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:53:10,282 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:53:10,283 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:53:10,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:53:10,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:53:10,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:53:10,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:53:10,284 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:53:10,284 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:53:10,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:53:10,285 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 08:53:10,292 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:53:10,292 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:53:10,292 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 08:53:10,293 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 08:53:10,293 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 08:53:10,293 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 08:53:10,293 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 08:53:10,293 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 08:53:10,293 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 08:53:10,293 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 08:53:10,294 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:53:10,294 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 08:53:10,294 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 08:53:10,294 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:53:10,294 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 08:53:10,294 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 08:53:10,295 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 08:53:10,295 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 08:53:10,295 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 08:53:10,295 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 08:53:10,295 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 08:53:10,295 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 08:53:10,295 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 08:53:10,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:53:10,296 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:53:10,296 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 08:53:10,296 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 08:53:10,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 08:53:10,296 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:53:10,296 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 08:53:10,296 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 08:53:10,297 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 08:53:10,297 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 08:53:10,297 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 08:53:10,297 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 08:53:10,297 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_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db17479a00afa98e4ce70a37e790a923b748e4dc [2018-12-09 08:53:10,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:53:10,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:53:10,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:53:10,329 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:53:10,329 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:53:10,330 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 08:53:10,375 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/data/61df4009f/60f528a99554487f97a2c4e54197d254/FLAG020032d4a [2018-12-09 08:53:10,701 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:53:10,702 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 08:53:10,708 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/data/61df4009f/60f528a99554487f97a2c4e54197d254/FLAG020032d4a [2018-12-09 08:53:11,123 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/data/61df4009f/60f528a99554487f97a2c4e54197d254 [2018-12-09 08:53:11,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:53:11,126 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:53:11,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:53:11,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:53:11,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:53:11,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:53:11" (1/1) ... [2018-12-09 08:53:11,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785ac8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11, skipping insertion in model container [2018-12-09 08:53:11,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:53:11" (1/1) ... [2018-12-09 08:53:11,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:53:11,161 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:53:11,344 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:53:11,353 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:53:11,418 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:53:11,441 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:53:11,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11 WrapperNode [2018-12-09 08:53:11,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:53:11,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:53:11,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:53:11,442 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:53:11,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11" (1/1) ... [2018-12-09 08:53:11,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11" (1/1) ... [2018-12-09 08:53:11,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:53:11,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:53:11,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:53:11,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:53:11,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11" (1/1) ... [2018-12-09 08:53:11,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11" (1/1) ... [2018-12-09 08:53:11,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11" (1/1) ... [2018-12-09 08:53:11,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11" (1/1) ... [2018-12-09 08:53:11,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11" (1/1) ... [2018-12-09 08:53:11,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11" (1/1) ... [2018-12-09 08:53:11,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11" (1/1) ... [2018-12-09 08:53:11,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:53:11,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:53:11,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:53:11,483 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:53:11,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 08:53:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 08:53:11,513 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 08:53:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:53:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 08:53:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 08:53:11,514 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 08:53:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 08:53:11,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 08:53:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 08:53:11,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 08:53:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-12-09 08:53:11,514 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-12-09 08:53:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 08:53:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 08:53:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-09 08:53:11,514 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-09 08:53:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 08:53:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 08:53:11,515 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-09 08:53:11,515 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-09 08:53:11,515 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-12-09 08:53:11,515 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-12-09 08:53:11,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:53:11,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:53:11,729 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:53:11,729 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 08:53:11,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:53:11 BoogieIcfgContainer [2018-12-09 08:53:11,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:53:11,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 08:53:11,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 08:53:11,731 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 08:53:11,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:53:11" (1/3) ... [2018-12-09 08:53:11,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9e996c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:53:11, skipping insertion in model container [2018-12-09 08:53:11,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:53:11" (2/3) ... [2018-12-09 08:53:11,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9e996c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:53:11, skipping insertion in model container [2018-12-09 08:53:11,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:53:11" (3/3) ... [2018-12-09 08:53:11,733 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 08:53:11,739 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 08:53:11,743 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 08:53:11,752 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 08:53:11,767 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 08:53:11,768 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 08:53:11,768 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 08:53:11,768 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 08:53:11,768 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:53:11,768 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:53:11,768 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 08:53:11,768 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:53:11,768 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 08:53:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-12-09 08:53:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 08:53:11,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:53:11,781 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] [2018-12-09 08:53:11,782 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:53:11,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:53:11,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1776900725, now seen corresponding path program 1 times [2018-12-09 08:53:11,788 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:53:11,788 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:53:11,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:53:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:53:11,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:53:11,903 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-09 08:53:11,903 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 08:53:11,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:53:11,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:53:11,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:53:11,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:53:11,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:53:11,917 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 5 states. [2018-12-09 08:53:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:53:11,999 INFO L93 Difference]: Finished difference Result 99 states and 131 transitions. [2018-12-09 08:53:12,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:53:12,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-09 08:53:12,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:53:12,006 INFO L225 Difference]: With dead ends: 99 [2018-12-09 08:53:12,006 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 08:53:12,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-09 08:53:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 08:53:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-12-09 08:53:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 08:53:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 08:53:12,034 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 31 [2018-12-09 08:53:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:53:12,034 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 08:53:12,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:53:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 08:53:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 08:53:12,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:53:12,036 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] [2018-12-09 08:53:12,036 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:53:12,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:53:12,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1601339917, now seen corresponding path program 1 times [2018-12-09 08:53:12,037 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:53:12,037 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:53:12,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:53:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:53:12,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:53:12,141 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-09 08:53:12,141 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 08:53:12,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:53:12,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:53:12,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:53:12,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:53:12,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:53:12,145 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-09 08:53:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:53:12,179 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-12-09 08:53:12,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:53:12,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-09 08:53:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:53:12,181 INFO L225 Difference]: With dead ends: 64 [2018-12-09 08:53:12,181 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 08:53:12,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:53:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 08:53:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-12-09 08:53:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 08:53:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-09 08:53:12,189 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 39 [2018-12-09 08:53:12,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:53:12,189 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-09 08:53:12,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:53:12,190 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-09 08:53:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 08:53:12,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:53:12,191 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] [2018-12-09 08:53:12,191 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:53:12,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:53:12,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1095764041, now seen corresponding path program 1 times [2018-12-09 08:53:12,192 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:53:12,192 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:53:12,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:53:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:53:12,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:53:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:53:12,324 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 08:53:12,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:53:12,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:53:12,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:53:12,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:53:12,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:53:12,327 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 6 states. [2018-12-09 08:53:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:53:12,408 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-12-09 08:53:12,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:53:12,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-09 08:53:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:53:12,411 INFO L225 Difference]: With dead ends: 76 [2018-12-09 08:53:12,411 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 08:53:12,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:53:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 08:53:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-12-09 08:53:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 08:53:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-12-09 08:53:12,417 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 47 [2018-12-09 08:53:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:53:12,418 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-12-09 08:53:12,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:53:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-12-09 08:53:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 08:53:12,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:53:12,419 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] [2018-12-09 08:53:12,419 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:53:12,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:53:12,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2124761295, now seen corresponding path program 1 times [2018-12-09 08:53:12,419 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:53:12,419 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:53:12,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:53:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:53:12,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:53:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 08:53:12,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:53:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 08:53:12,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:53:12,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/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-09 08:53:12,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:53:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:53:12,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:53:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 08:53:12,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:53:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 08:53:12,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 08:53:12,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6] total 10 [2018-12-09 08:53:12,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 08:53:12,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 08:53:12,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 08:53:12,737 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 10 states. [2018-12-09 08:53:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:53:12,879 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2018-12-09 08:53:12,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:53:12,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-12-09 08:53:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:53:12,880 INFO L225 Difference]: With dead ends: 88 [2018-12-09 08:53:12,880 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 08:53:12,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-12-09 08:53:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 08:53:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2018-12-09 08:53:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 08:53:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-12-09 08:53:12,888 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 48 [2018-12-09 08:53:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:53:12,888 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-12-09 08:53:12,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 08:53:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-12-09 08:53:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 08:53:12,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:53:12,889 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] [2018-12-09 08:53:12,889 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:53:12,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:53:12,889 INFO L82 PathProgramCache]: Analyzing trace with hash 711402375, now seen corresponding path program 2 times [2018-12-09 08:53:12,890 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:53:12,890 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:53:12,903 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 08:53:12,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-09 08:53:12,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:53:12,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:53:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 08:53:12,978 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 08:53:12,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:53:12,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:53:12,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:53:12,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:53:12,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:53:12,980 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 6 states. [2018-12-09 08:53:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:53:13,047 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-12-09 08:53:13,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:53:13,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-09 08:53:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:53:13,049 INFO L225 Difference]: With dead ends: 78 [2018-12-09 08:53:13,049 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 08:53:13,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:53:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 08:53:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-12-09 08:53:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 08:53:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2018-12-09 08:53:13,056 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 56 [2018-12-09 08:53:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:53:13,056 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2018-12-09 08:53:13,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:53:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2018-12-09 08:53:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 08:53:13,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:53:13,057 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] [2018-12-09 08:53:13,057 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:53:13,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:53:13,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2117596392, now seen corresponding path program 1 times [2018-12-09 08:53:13,058 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:53:13,058 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:53:13,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:53:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:53:13,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:53:13,239 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-09 08:53:13,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 08:53:13,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:13,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:13,316 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-09 08:53:13,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-12-09 08:53:13,349 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-09 08:53:13,351 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-09 08:53:13,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-09 08:53:13,400 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 47 treesize of output 43 [2018-12-09 08:53:13,403 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 12 treesize of output 11 [2018-12-09 08:53:13,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,427 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 19 treesize of output 12 [2018-12-09 08:53:13,429 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 12 treesize of output 11 [2018-12-09 08:53:13,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,441 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 1 xjuncts. [2018-12-09 08:53:13,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2018-12-09 08:53:13,793 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-09 08:53:13,798 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-09 08:53:13,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:13,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2018-12-09 08:53:13,942 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:53:13,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 132 [2018-12-09 08:53:13,996 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 38 treesize of output 21 [2018-12-09 08:53:13,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 08:53:14,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:53:14,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:14,091 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:53:14,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 96 [2018-12-09 08:53:14,118 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 38 treesize of output 9 [2018-12-09 08:53:14,118 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:14,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:14,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:14,135 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:53:14,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 98 [2018-12-09 08:53:14,178 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 38 treesize of output 21 [2018-12-09 08:53:14,178 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 08:53:14,198 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:53:14,242 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-09 08:53:14,243 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:139, output treesize:101 [2018-12-09 08:53:25,232 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 08:53:25,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:25,271 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 36 treesize of output 41 [2018-12-09 08:53:25,275 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-09 08:53:25,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:25,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:25,344 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 50 treesize of output 43 [2018-12-09 08:53:25,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:25,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 43 treesize of output 40 [2018-12-09 08:53:25,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:25,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:25,401 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 42 treesize of output 37 [2018-12-09 08:53:25,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:25,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-09 08:53:25,410 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:25,418 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:25,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:25,435 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:90, output treesize:39 [2018-12-09 08:53:26,148 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 52 treesize of output 50 [2018-12-09 08:53:26,152 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 46 treesize of output 35 [2018-12-09 08:53:26,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:26,186 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 35 treesize of output 16 [2018-12-09 08:53:26,186 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:26,217 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 9 [2018-12-09 08:53:26,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:26,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:26,250 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 17 treesize of output 21 [2018-12-09 08:53:26,252 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 17 treesize of output 15 [2018-12-09 08:53:26,252 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:26,264 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 13 treesize of output 9 [2018-12-09 08:53:26,264 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:26,266 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:26,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:26,268 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:71, output treesize:9 [2018-12-09 08:53:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 08:53:26,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:53:27,466 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-09 08:53:27,570 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-09 08:53:27,574 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-09 08:53:27,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:27,602 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-09 08:53:27,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:27,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:27,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:41 [2018-12-09 08:53:27,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:53:27,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:53:27,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:53:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:53:27,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:53:27,859 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-09 08:53:27,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:27,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:27,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 08:53:28,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:28,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:28,278 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 13 treesize of output 4 [2018-12-09 08:53:28,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:28,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:28,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-09 08:53:28,372 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-09 08:53:28,375 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-09 08:53:28,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:28,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:28,390 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-09 08:53:28,392 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 8 treesize of output 7 [2018-12-09 08:53:28,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:28,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:28,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:28,400 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-12-09 08:53:28,528 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 47 treesize of output 43 [2018-12-09 08:53:28,531 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 12 treesize of output 11 [2018-12-09 08:53:28,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:28,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:28,567 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 27 treesize of output 28 [2018-12-09 08:53:28,569 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 12 treesize of output 11 [2018-12-09 08:53:28,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:28,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:28,586 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 1 xjuncts. [2018-12-09 08:53:28,586 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:38 [2018-12-09 08:53:29,307 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-09 08:53:29,311 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-09 08:53:29,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:29,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:29,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:29,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2018-12-09 08:53:29,376 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 119 treesize of output 114 [2018-12-09 08:53:29,412 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 38 treesize of output 21 [2018-12-09 08:53:29,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 08:53:29,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:53:29,514 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 97 treesize of output 87 [2018-12-09 08:53:29,520 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 38 treesize of output 9 [2018-12-09 08:53:29,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:29,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:29,547 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 99 treesize of output 89 [2018-12-09 08:53:29,569 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 38 treesize of output 21 [2018-12-09 08:53:29,569 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 08:53:29,586 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:53:29,628 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-09 08:53:29,628 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:143, output treesize:109 [2018-12-09 08:53:29,922 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 50 treesize of output 43 [2018-12-09 08:53:29,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:29,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-09 08:53:29,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:29,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:30,007 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 37 treesize of output 42 [2018-12-09 08:53:30,010 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-09 08:53:30,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:30,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:30,052 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 51 treesize of output 44 [2018-12-09 08:53:30,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:53:30,060 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 44 treesize of output 38 [2018-12-09 08:53:30,061 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:30,072 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:30,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:30,088 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:95, output treesize:44 [2018-12-09 08:53:31,204 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 54 treesize of output 52 [2018-12-09 08:53:31,208 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 48 treesize of output 29 [2018-12-09 08:53:31,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,227 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 29 treesize of output 18 [2018-12-09 08:53:31,227 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,242 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:53:31,242 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 23 treesize of output 19 [2018-12-09 08:53:31,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,270 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 15 treesize of output 19 [2018-12-09 08:53:31,273 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 15 treesize of output 10 [2018-12-09 08:53:31,274 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,289 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 10 treesize of output 4 [2018-12-09 08:53:31,290 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,302 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 11 treesize of output 1 [2018-12-09 08:53:31,302 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,303 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,322 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 17 treesize of output 21 [2018-12-09 08:53:31,325 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 17 treesize of output 15 [2018-12-09 08:53:31,325 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,339 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 11 treesize of output 9 [2018-12-09 08:53:31,340 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,357 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 13 treesize of output 17 [2018-12-09 08:53:31,358 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,359 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:53:31,362 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:87, output treesize:7 [2018-12-09 08:53:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 08:53:31,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:53:32,166 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-09 08:53:32,271 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-09 08:53:32,275 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-09 08:53:32,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:32,311 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-09 08:53:32,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:32,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 08:53:32,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:48 [2018-12-09 08:53:32,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 08:53:32,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 50 [2018-12-09 08:53:32,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-09 08:53:32,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-09 08:53:32,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3448, Unknown=23, NotChecked=0, Total=3660 [2018-12-09 08:53:32,614 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 50 states. [2018-12-09 08:54:13,170 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-09 08:54:38,729 WARN L180 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 08:55:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:55:20,525 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2018-12-09 08:55:20,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 08:55:20,526 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 57 [2018-12-09 08:55:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:55:20,527 INFO L225 Difference]: With dead ends: 125 [2018-12-09 08:55:20,527 INFO L226 Difference]: Without dead ends: 123 [2018-12-09 08:55:20,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1651 ImplicationChecksByTransitivity, 58.6s TimeCoverageRelationStatistics Valid=433, Invalid=6831, Unknown=46, NotChecked=0, Total=7310 [2018-12-09 08:55:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-09 08:55:20,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2018-12-09 08:55:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-09 08:55:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2018-12-09 08:55:20,542 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 57 [2018-12-09 08:55:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:55:20,543 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2018-12-09 08:55:20,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-09 08:55:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2018-12-09 08:55:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 08:55:20,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:55:20,544 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] [2018-12-09 08:55:20,544 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:55:20,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:55:20,544 INFO L82 PathProgramCache]: Analyzing trace with hash 377755047, now seen corresponding path program 2 times [2018-12-09 08:55:20,544 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:55:20,544 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:55:20,557 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 08:55:20,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 08:55:20,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:55:20,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:55:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 08:55:20,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:55:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 08:55:20,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:55:20,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:55:20,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 08:55:21,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 08:55:21,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:55:21,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:55:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 08:55:21,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:55:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 08:55:21,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 08:55:21,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-09 08:55:21,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 08:55:21,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 08:55:21,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-09 08:55:21,466 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand 18 states. [2018-12-09 08:55:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:55:22,319 INFO L93 Difference]: Finished difference Result 177 states and 246 transitions. [2018-12-09 08:55:22,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 08:55:22,320 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-12-09 08:55:22,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:55:22,321 INFO L225 Difference]: With dead ends: 177 [2018-12-09 08:55:22,321 INFO L226 Difference]: Without dead ends: 145 [2018-12-09 08:55:22,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-12-09 08:55:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-09 08:55:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2018-12-09 08:55:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-09 08:55:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 189 transitions. [2018-12-09 08:55:22,342 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 189 transitions. Word has length 58 [2018-12-09 08:55:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:55:22,343 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 189 transitions. [2018-12-09 08:55:22,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 08:55:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 189 transitions. [2018-12-09 08:55:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 08:55:22,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:55:22,344 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] [2018-12-09 08:55:22,344 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:55:22,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:55:22,345 INFO L82 PathProgramCache]: Analyzing trace with hash 151269484, now seen corresponding path program 3 times [2018-12-09 08:55:22,345 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:55:22,345 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:55:22,361 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 08:55:22,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 08:55:22,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:55:22,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:55:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 08:55:22,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:55:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 08:55:22,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:55:22,604 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:55:22,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 08:55:23,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 08:55:23,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:55:23,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:55:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 08:55:23,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:55:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 08:55:23,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:55:23,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7, 7] total 15 [2018-12-09 08:55:23,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 08:55:23,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 08:55:23,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-12-09 08:55:23,283 INFO L87 Difference]: Start difference. First operand 135 states and 189 transitions. Second operand 15 states. [2018-12-09 08:55:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:55:23,480 INFO L93 Difference]: Finished difference Result 194 states and 268 transitions. [2018-12-09 08:55:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 08:55:23,480 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-12-09 08:55:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:55:23,482 INFO L225 Difference]: With dead ends: 194 [2018-12-09 08:55:23,482 INFO L226 Difference]: Without dead ends: 139 [2018-12-09 08:55:23,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 216 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-09 08:55:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-09 08:55:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-12-09 08:55:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-09 08:55:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2018-12-09 08:55:23,498 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 58 [2018-12-09 08:55:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:55:23,498 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2018-12-09 08:55:23,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 08:55:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2018-12-09 08:55:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 08:55:23,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:55:23,499 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] [2018-12-09 08:55:23,499 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:55:23,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:55:23,499 INFO L82 PathProgramCache]: Analyzing trace with hash 504576000, now seen corresponding path program 4 times [2018-12-09 08:55:23,500 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:55:23,500 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:55:23,513 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 08:55:23,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 08:55:23,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:55:23,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:55:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 08:55:23,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:55:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 08:55:23,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:55:23,766 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:55:23,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 08:55:23,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 08:55:23,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:55:23,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:55:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 08:55:23,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:55:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 08:55:24,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 08:55:24,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-09 08:55:24,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 08:55:24,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 08:55:24,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-09 08:55:24,233 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand 18 states. [2018-12-09 08:55:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:55:24,974 INFO L93 Difference]: Finished difference Result 209 states and 269 transitions. [2018-12-09 08:55:24,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 08:55:24,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-12-09 08:55:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:55:24,975 INFO L225 Difference]: With dead ends: 209 [2018-12-09 08:55:24,975 INFO L226 Difference]: Without dead ends: 143 [2018-12-09 08:55:24,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-12-09 08:55:24,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-09 08:55:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2018-12-09 08:55:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 08:55:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 172 transitions. [2018-12-09 08:55:24,996 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 172 transitions. Word has length 58 [2018-12-09 08:55:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:55:24,996 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 172 transitions. [2018-12-09 08:55:24,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 08:55:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 172 transitions. [2018-12-09 08:55:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 08:55:24,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:55:24,997 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-09 08:55:24,998 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:55:24,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:55:24,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1942991232, now seen corresponding path program 5 times [2018-12-09 08:55:24,998 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:55:24,998 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:55:25,017 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-12-09 08:55:25,149 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-09 08:55:25,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:55:25,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:55:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 08:55:25,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:55:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 08:55:25,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 08:55:25,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2018-12-09 08:55:25,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 08:55:25,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 08:55:25,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-09 08:55:25,369 INFO L87 Difference]: Start difference. First operand 133 states and 172 transitions. Second operand 11 states. [2018-12-09 08:55:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:55:25,529 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2018-12-09 08:55:25,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:55:25,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-12-09 08:55:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:55:25,530 INFO L225 Difference]: With dead ends: 148 [2018-12-09 08:55:25,530 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 08:55:25,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 08:55:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 08:55:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-09 08:55:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-09 08:55:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2018-12-09 08:55:25,541 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 65 [2018-12-09 08:55:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:55:25,541 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2018-12-09 08:55:25,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 08:55:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2018-12-09 08:55:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 08:55:25,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:55:25,541 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 08:55:25,542 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:55:25,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:55:25,542 INFO L82 PathProgramCache]: Analyzing trace with hash -452304837, now seen corresponding path program 1 times [2018-12-09 08:55:25,542 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:55:25,542 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:55:25,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:55:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:55:25,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:55:25,755 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-09 08:55:25,757 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-09 08:55:25,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:55:25,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:55:25,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:55:25,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 08:55:26,151 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 24 treesize of output 26 [2018-12-09 08:55:26,154 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 15 treesize of output 8 [2018-12-09 08:55:26,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:55:26,165 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 13 treesize of output 5 [2018-12-09 08:55:26,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:55:26,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:55:26,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:55:26,170 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:11 [2018-12-09 08:55:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 08:55:26,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:55:27,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 08:55:27,032 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 11 treesize of output 7 [2018-12-09 08:55:27,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:55:27,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:55:27,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-09 08:55:27,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:41 [2018-12-09 08:55:27,435 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-09 08:55:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 08:55:27,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:55:27,759 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:55:27,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:55:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:55:27,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:55:27,874 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-09 08:55:27,876 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-09 08:55:27,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:55:27,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:55:27,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:55:27,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 08:55:28,515 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 24 treesize of output 26 [2018-12-09 08:55:28,518 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 15 treesize of output 8 [2018-12-09 08:55:28,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:55:28,528 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 11 treesize of output 3 [2018-12-09 08:55:28,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:55:28,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:55:28,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:55:28,536 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:35, output treesize:9 [2018-12-09 08:55:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 08:55:28,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:55:30,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 08:55:30,187 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 11 treesize of output 7 [2018-12-09 08:55:30,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:55:30,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:55:30,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-09 08:55:30,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:74 [2018-12-09 08:55:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 08:55:30,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 08:55:30,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 24, 15] total 52 [2018-12-09 08:55:30,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-09 08:55:30,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-09 08:55:30,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2431, Unknown=0, NotChecked=0, Total=2652 [2018-12-09 08:55:30,565 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand 52 states. [2018-12-09 08:55:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:55:35,022 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2018-12-09 08:55:35,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 08:55:35,023 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 66 [2018-12-09 08:55:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:55:35,024 INFO L225 Difference]: With dead ends: 120 [2018-12-09 08:55:35,024 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 08:55:35,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 204 SyntacticMatches, 10 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=383, Invalid=3523, Unknown=0, NotChecked=0, Total=3906 [2018-12-09 08:55:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 08:55:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-09 08:55:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 08:55:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-12-09 08:55:35,030 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 66 [2018-12-09 08:55:35,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:55:35,031 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-12-09 08:55:35,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-09 08:55:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-12-09 08:55:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 08:55:35,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:55:35,031 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] [2018-12-09 08:55:35,031 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:55:35,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:55:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash 462185700, now seen corresponding path program 2 times [2018-12-09 08:55:35,031 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:55:35,032 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:55:35,045 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 08:55:35,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 08:55:35,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:55:35,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:55:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 08:55:35,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:55:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 08:55:35,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:55:35,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:55:35,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 08:55:35,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 08:55:35,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:55:35,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:55:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 08:55:35,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:55:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 08:55:35,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 08:55:35,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-09 08:55:35,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 08:55:35,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 08:55:35,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-12-09 08:55:35,713 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 18 states. [2018-12-09 08:55:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:55:35,963 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-09 08:55:35,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 08:55:35,964 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-12-09 08:55:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:55:35,964 INFO L225 Difference]: With dead ends: 60 [2018-12-09 08:55:35,964 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 08:55:35,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-12-09 08:55:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 08:55:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 08:55:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 08:55:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 08:55:35,965 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-12-09 08:55:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:55:35,965 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 08:55:35,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 08:55:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 08:55:35,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 08:55:35,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 08:55:36,682 WARN L180 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2018-12-09 08:55:36,943 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2018-12-09 08:55:37,244 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-12-09 08:55:37,415 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-12-09 08:55:37,674 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-12-09 08:55:37,917 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2018-12-09 08:55:37,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 08:55:37,945 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-12-09 08:55:37,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 08:55:37,945 INFO L451 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: true [2018-12-09 08:55:37,945 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 560 562) the Hoare annotation is: true [2018-12-09 08:55:37,945 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 560 562) no Hoare annotation was computed. [2018-12-09 08:55:37,945 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 560 562) no Hoare annotation was computed. [2018-12-09 08:55:37,945 INFO L448 ceAbstractionStarter]: For program point sll_circular_get_data_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-12-09 08:55:37,945 INFO L451 ceAbstractionStarter]: At program point sll_circular_get_data_atENTRY(lines 595 601) the Hoare annotation is: true [2018-12-09 08:55:37,945 INFO L444 ceAbstractionStarter]: At program point L596-2(lines 596 599) the Hoare annotation is: (or (forall ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32))) (not (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_9) (_ bv4 32)) (_ bv4294967294 32)) (_ bv0 32)))) (let ((.cse0 (bvadd sll_circular_get_data_at_~index (_ bv1 32)))) (and (bvsgt .cse0 (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (= .cse0 |sll_circular_get_data_at_#in~index|))) (forall ((v_main_~s~0.base_BEFORE_CALL_7 (_ BitVec 32)) (v_main_~s~0.offset_BEFORE_CALL_7 (_ BitVec 32))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_7)) (.cse2 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_7) v_main_~s~0.offset_BEFORE_CALL_7))) (or (not (= .cse1 (_ bv0 32))) (not (= (_ bv3 32) (select (select |#memory_int| .cse2) (bvadd .cse1 (_ bv4 32))))) (= .cse2 v_main_~s~0.base_BEFORE_CALL_7)))) (bvsgt (bvadd |sll_circular_get_data_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) (forall ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (let ((.cse3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)))) (or (not (= (_ bv3 32) (select (select |#memory_int| .cse3) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4 32))))) (= v_main_~s~0.base_BEFORE_CALL_3 .cse3)))) (and (= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|) (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|))) [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point L596-3(lines 596 599) no Hoare annotation was computed. [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point sll_circular_get_data_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-12-09 08:55:37,946 INFO L444 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (or (and (bvsgt (bvadd |sll_circular_create_#in~len| (_ bv4294967295 32)) (_ bv1 32)) (bvsgt |sll_circular_create_#in~len| (_ bv1 32))) (and (= sll_circular_create_~head~0.offset (_ bv0 32)) (bvsgt sll_circular_create_~len (_ bv1 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= |sll_circular_create_#in~len| sll_circular_create_~len) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))) [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-12-09 08:55:37,946 INFO L444 ceAbstractionStarter]: At program point L573(line 573) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_create_#in~len| sll_circular_create_~len)) [2018-12-09 08:55:37,946 INFO L444 ceAbstractionStarter]: At program point L575-2(lines 575 580) the Hoare annotation is: (let ((.cse1 (bvsgt |sll_circular_create_#in~len| (_ bv1 32))) (.cse0 (bvadd |sll_circular_create_#in~len| (_ bv4294967295 32))) (.cse2 (= sll_circular_create_~head~0.offset (_ bv0 32))) (.cse3 (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base))) (or (and (bvsgt .cse0 (_ bv1 32)) .cse1) (and .cse1 (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) .cse2 (= .cse0 sll_circular_create_~len) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not .cse3)) (and .cse2 .cse3 (= |sll_circular_create_#in~len| sll_circular_create_~len) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1))))) [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point L573-1(line 573) no Hoare annotation was computed. [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point L575-3(lines 575 580) no Hoare annotation was computed. [2018-12-09 08:55:37,946 INFO L444 ceAbstractionStarter]: At program point sll_circular_createENTRY(lines 572 583) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point sll_circular_createFINAL(lines 572 583) no Hoare annotation was computed. [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point sll_circular_createEXIT(lines 572 583) no Hoare annotation was computed. [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 08:55:37,946 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 08:55:37,946 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 626) no Hoare annotation was computed. [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 609 628) no Hoare annotation was computed. [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point L624(line 624) no Hoare annotation was computed. [2018-12-09 08:55:37,946 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 609 628) no Hoare annotation was computed. [2018-12-09 08:55:37,947 INFO L444 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse6 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset)) (.cse5 (bvmul (_ bv2 32) main_~len~0))) (let ((.cse0 (= main_~s~0.offset (_ bv0 32))) (.cse1 (= (bvadd (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (_ bv2 32)) .cse5)) (.cse3 (= .cse6 (_ bv0 32))) (.cse4 (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd .cse6 (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))) (or (let ((.cse2 (bvadd main_~len~0 (_ bv4294967294 32)))) (and .cse0 (= (bvadd main_~expected~0 (_ bv4294967294 32)) main_~i~0) .cse1 (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) (= .cse2 (_ bv0 32)) .cse3 (= .cse2 main_~i~0) .cse4)) (and (= (bvadd .cse5 (_ bv4294967294 32)) main_~new_data~0) .cse0 .cse1 (= (_ bv3 32) main_~expected~0) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) .cse3 .cse4 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))))) [2018-12-09 08:55:37,947 INFO L448 ceAbstractionStarter]: For program point L620-1(lines 620 622) no Hoare annotation was computed. [2018-12-09 08:55:37,947 INFO L444 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse7 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (let ((.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse3 (= .cse7 (_ bv0 32))) (.cse4 (not (= (select .cse6 (_ bv0 32)) main_~s~0.base))) (.cse0 (bvneg main_~len~0))) (or (and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd .cse0 main_~new_data~0)) .cse1 (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (let ((.cse2 (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse2) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.base| .cse2) sll_circular_create_~last~0.offset) main_~s~0.base)))) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) .cse3 .cse4 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse5 (bvadd main_~len~0 (_ bv4294967294 32)))) (and .cse1 (= .cse5 (_ bv0 32)) (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) .cse3 .cse4 (= .cse5 main_~i~0) (= (bvadd (select (select |#memory_int| (select .cse6 main_~s~0.offset)) (bvadd .cse7 (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg .cse0) main_~len~0))))))) [2018-12-09 08:55:37,947 INFO L448 ceAbstractionStarter]: For program point L618-2(lines 618 623) no Hoare annotation was computed. [2018-12-09 08:55:37,947 INFO L448 ceAbstractionStarter]: For program point L616-1(lines 614 617) no Hoare annotation was computed. [2018-12-09 08:55:37,947 INFO L444 ceAbstractionStarter]: At program point L618-3(lines 618 623) the Hoare annotation is: (let ((.cse7 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset)) (.cse6 (bvadd main_~len~0 (_ bv4294967294 32))) (.cse8 (bvmul (_ bv2 32) main_~len~0))) (let ((.cse0 (= (bvadd .cse8 (_ bv4294967294 32)) main_~new_data~0)) (.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse2 (= (bvadd (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (_ bv2 32)) .cse8)) (.cse5 (= .cse6 (_ bv0 32))) (.cse3 (= .cse7 (_ bv0 32))) (.cse4 (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd .cse7 (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))) (or (and .cse0 .cse1 .cse2 (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) .cse3 .cse4 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse5 (= (bvadd main_~expected~0 (_ bv4294967294 32)) (_ bv0 32)) .cse3 (= (bvadd main_~len~0 (_ bv4294967293 32)) main_~i~0) .cse4) (and .cse1 .cse2 .cse5 (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) .cse3 (= .cse6 main_~i~0) .cse4)))) [2018-12-09 08:55:37,947 INFO L444 ceAbstractionStarter]: At program point L618-4(lines 618 623) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-12-09 08:55:37,947 INFO L444 ceAbstractionStarter]: At program point L612(line 612) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-09 08:55:37,947 INFO L444 ceAbstractionStarter]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse9 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset)) (.cse5 (bvadd main_~len~0 (_ bv4294967294 32))) (.cse8 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse3 (not (= (select .cse8 (_ bv0 32)) main_~s~0.base))) (.cse0 (= main_~s~0.offset (_ bv0 32))) (.cse4 (= .cse5 (_ bv0 32))) (.cse2 (= .cse9 (_ bv0 32))) (.cse6 (= (bvadd (select (select |#memory_int| (select .cse8 main_~s~0.offset)) (bvadd .cse9 (_ bv4 32))) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))) (or (and .cse0 (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (let ((.cse1 (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse1) sll_circular_create_~last~0.offset)) (= (select (select |#memory_$Pointer$.base| .cse1) sll_circular_create_~last~0.offset) main_~s~0.base)))) (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) .cse2 .cse3 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 .cse4 .cse2 .cse3 (= .cse5 main_~i~0) .cse6) (let ((.cse7 (bvmul (_ bv2 32) main_~len~0))) (and (= (bvadd .cse7 (_ bv4294967294 32)) main_~new_data~0) .cse0 (= (bvadd (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) (_ bv2 32)) .cse7) .cse4 (= (bvadd main_~len~0 (_ bv4294967293 32)) main_~i~0) .cse2 .cse6))))) [2018-12-09 08:55:37,947 INFO L448 ceAbstractionStarter]: For program point L612-1(line 612) no Hoare annotation was computed. [2018-12-09 08:55:37,947 INFO L448 ceAbstractionStarter]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2018-12-09 08:55:37,947 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 609 628) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-09 08:55:37,947 INFO L444 ceAbstractionStarter]: At program point L621(lines 609 628) the Hoare annotation is: false [2018-12-09 08:55:37,947 INFO L451 ceAbstractionStarter]: At program point sll_circular_destroyENTRY(lines 584 594) the Hoare annotation is: true [2018-12-09 08:55:37,948 INFO L448 ceAbstractionStarter]: For program point sll_circular_destroyEXIT(lines 584 594) no Hoare annotation was computed. [2018-12-09 08:55:37,948 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 593) no Hoare annotation was computed. [2018-12-09 08:55:37,948 INFO L451 ceAbstractionStarter]: At program point L587-2(lines 587 591) the Hoare annotation is: true [2018-12-09 08:55:37,948 INFO L448 ceAbstractionStarter]: For program point L587-3(lines 587 591) no Hoare annotation was computed. [2018-12-09 08:55:37,948 INFO L448 ceAbstractionStarter]: For program point L585-2(lines 584 594) no Hoare annotation was computed. [2018-12-09 08:55:37,948 INFO L448 ceAbstractionStarter]: For program point sll_circular_update_atEXIT(lines 602 608) no Hoare annotation was computed. [2018-12-09 08:55:37,948 INFO L444 ceAbstractionStarter]: At program point sll_circular_update_atENTRY(lines 602 608) the Hoare annotation is: (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-09 08:55:37,948 INFO L448 ceAbstractionStarter]: For program point sll_circular_update_atFINAL(lines 602 608) no Hoare annotation was computed. [2018-12-09 08:55:37,948 INFO L444 ceAbstractionStarter]: At program point L603-2(lines 603 606) the Hoare annotation is: (let ((.cse0 (= sll_circular_update_at_~index |sll_circular_update_at_#in~index|)) (.cse4 (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))) (and (let ((.cse1 (= |old(#memory_int)| |#memory_int|)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse3 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3))) (let ((.cse5 (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data))) (or (and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) .cse0 .cse5) (and .cse4 (bvsgt (bvadd |sll_circular_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32))) (and (= (bvadd sll_circular_update_at_~index (_ bv1 32)) |sll_circular_update_at_#in~index|) (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) .cse5 (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base)))))) [2018-12-09 08:55:37,948 INFO L448 ceAbstractionStarter]: For program point L603-3(lines 603 606) no Hoare annotation was computed. [2018-12-09 08:55:37,948 INFO L444 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-09 08:55:37,948 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-12-09 08:55:37,948 INFO L451 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-12-09 08:55:37,948 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-12-09 08:55:37,948 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-12-09 08:55:37,948 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-12-09 08:55:37,953 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,953 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,957 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,957 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,959 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,959 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-09 08:55:37,959 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,959 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-09 08:55:37,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,960 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,961 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,962 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-09 08:55:37,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-09 08:55:37,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,965 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_9,QUANTIFIED] [2018-12-09 08:55:37,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,968 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,968 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,969 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,969 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-09 08:55:37,969 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-09 08:55:37,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-09 08:55:37,970 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-09 08:55:37,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,971 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_9,QUANTIFIED] [2018-12-09 08:55:37,971 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,972 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,972 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,972 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,972 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,973 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:37,973 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,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-09 08:55:37,973 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,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-09 08:55:37,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-09 08:55:37,973 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,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-09 08:55:37,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,974 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,975 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,977 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,978 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,978 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,978 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,978 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,979 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,980 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,981 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,981 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,981 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,981 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,981 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,982 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,984 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,984 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,984 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,984 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,984 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:37,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:37,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:37,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:37,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:55:37 BoogieIcfgContainer [2018-12-09 08:55:37,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 08:55:37,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 08:55:37,988 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 08:55:37,988 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 08:55:37,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:53:11" (3/4) ... [2018-12-09 08:55:37,991 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 08:55:37,995 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 08:55:37,995 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-09 08:55:37,995 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_get_data_at [2018-12-09 08:55:37,995 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2018-12-09 08:55:37,996 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 08:55:37,996 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_destroy [2018-12-09 08:55:37,996 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_update_at [2018-12-09 08:55:37,996 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-12-09 08:55:37,999 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-09 08:55:37,999 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-09 08:55:37,999 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 08:55:38,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == 0bv32 && (\exists sll_circular_create_~last~0.offset : bv32 :: 0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][sll_circular_create_~last~0.offset] && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][sll_circular_create_~last~0.offset] == s)) && ~bvadd64(i, 1bv32) == len) && #memory_$Pointer$[s][s] == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && ~bvadd64(i, 4294967295bv32) == 0bv32) || (((((s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && #memory_$Pointer$[s][s] == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && ~bvadd64(len, 4294967294bv32) == i) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len))) || ((((((~bvadd64(~bvmul32(2bv32, len), 4294967294bv32) == new_data && s == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 4bv32)], 2bv32) == ~bvmul32(2bv32, len)) && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(len, 4294967293bv32) == i) && #memory_$Pointer$[s][s] == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len)) [2018-12-09 08:55:38,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~bvsgt32(~bvadd64(\old(len), 4294967295bv32), 1bv32) && ~bvsgt32(\old(len), 1bv32)) || (((((~bvsgt32(\old(len), 1bv32) && #memory_$Pointer$[head][head] == last) && head == 0bv32) && ~bvadd64(\old(len), 4294967295bv32) == len) && 0bv32 == #memory_$Pointer$[head][head]) && !(head == last))) || (((head == 0bv32 && head == last) && \old(len) == len) && ~bvadd64(\valid[head], 1bv1) == 0bv1) [2018-12-09 08:55:38,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((index == \old(index) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) || (((~bvsgt32(\old(index), 0bv32) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) && (((((head == head && head == head) && index == \old(index)) && \old(data) == data) || (~bvsgt32(\old(index), 0bv32) && ~bvsgt32(~bvadd64(\old(index), 4294967295bv32), 0bv32))) || (((~bvadd64(index, 1bv32) == \old(index) && #memory_$Pointer$[head][head] == head) && \old(data) == data) && #memory_$Pointer$[head][head] == head)) [2018-12-09 08:55:38,016 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((forall v_main_~s~0.base_BEFORE_CALL_9 : bv32 :: !(~bvadd64(unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_9][4bv32], 4294967294bv32) == 0bv32)) || (((~bvsgt32(~bvadd64(index, 1bv32), 0bv32) && #memory_$Pointer$[head][head] == head) && head == #memory_$Pointer$[head][head]) && ~bvadd64(index, 1bv32) == \old(index))) || (forall v_main_~s~0.base_BEFORE_CALL_7 : bv32, v_main_~s~0.offset_BEFORE_CALL_7 : bv32 :: (!(#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] == 0bv32) || !(3bv32 == unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7]][~bvadd64(#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7], 4bv32)])) || #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] == v_main_~s~0.base_BEFORE_CALL_7)) || ~bvsgt32(~bvadd64(\old(index), 4294967295bv32), 0bv32)) || (forall v_main_~s~0.base_BEFORE_CALL_3 : bv32 :: !(3bv32 == unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0bv32]][~bvadd64(#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0bv32], 4bv32)]) || v_main_~s~0.base_BEFORE_CALL_3 == #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0bv32])) || ((index == \old(index) && head == head) && head == head) [2018-12-09 08:55:38,026 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_baf37da5-4932-4cb3-82a6-e21abe90433a/bin-2019/utaipan/witness.graphml [2018-12-09 08:55:38,026 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 08:55:38,027 INFO L168 Benchmark]: Toolchain (without parser) took 146901.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 240.1 MB). Free memory was 938.0 MB in the beginning and 836.0 MB in the end (delta: 102.0 MB). Peak memory consumption was 342.1 MB. Max. memory is 11.5 GB. [2018-12-09 08:55:38,027 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:55:38,027 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-12-09 08:55:38,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.74 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-09 08:55:38,027 INFO L168 Benchmark]: Boogie Preprocessor took 21.69 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-09 08:55:38,027 INFO L168 Benchmark]: RCFGBuilder took 246.22 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 08:55:38,028 INFO L168 Benchmark]: TraceAbstraction took 146258.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 106.4 MB). Free memory was 1.1 GB in the beginning and 844.5 MB in the end (delta: 236.7 MB). Peak memory consumption was 343.1 MB. Max. memory is 11.5 GB. [2018-12-09 08:55:38,028 INFO L168 Benchmark]: Witness Printer took 38.26 ms. Allocated memory is still 1.3 GB. Free memory was 844.5 MB in the beginning and 836.0 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2018-12-09 08:55:38,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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.4 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.74 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 21.69 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. * RCFGBuilder took 246.22 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: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 146258.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 106.4 MB). Free memory was 1.1 GB in the beginning and 844.5 MB in the end (delta: 236.7 MB). Peak memory consumption was 343.1 MB. Max. memory is 11.5 GB. * Witness Printer took 38.26 ms. Allocated memory is still 1.3 GB. Free memory was 844.5 MB in the beginning and 836.0 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - 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_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - 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_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - 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 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.base_BEFORE_CALL_3,QUANTIFIED] - 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.base_BEFORE_CALL_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - 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_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - 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_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - 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 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.base_BEFORE_CALL_3,QUANTIFIED] - 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 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_$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_$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_$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_$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_$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_$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_$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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_$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_$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_$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_$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_$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_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 626]: 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: 575]: Loop Invariant [2018-12-09 08:55:38,032 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,032 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,033 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,033 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,033 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,033 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,033 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,033 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((~bvsgt32(~bvadd64(\old(len), 4294967295bv32), 1bv32) && ~bvsgt32(\old(len), 1bv32)) || (((((~bvsgt32(\old(len), 1bv32) && #memory_$Pointer$[head][head] == last) && head == 0bv32) && ~bvadd64(\old(len), 4294967295bv32) == len) && 0bv32 == #memory_$Pointer$[head][head]) && !(head == last))) || (((head == 0bv32 && head == last) && \old(len) == len) && ~bvadd64(\valid[head], 1bv1) == 0bv1) - InvariantResult [Line: 614]: Loop Invariant [2018-12-09 08:55:38,033 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-09 08:55:38,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-09 08:55:38,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,035 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,035 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,035 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,035 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,036 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,036 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-09 08:55:38,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sll_circular_create_~last~0.offset,QUANTIFIED] [2018-12-09 08:55:38,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,038 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,038 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,038 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,038 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,038 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,038 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,038 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,038 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,038 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,038 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((s == 0bv32 && (\exists sll_circular_create_~last~0.offset : bv32 :: 0bv32 == #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][sll_circular_create_~last~0.offset] && #memory_$Pointer$[#memory_$Pointer$[s][0bv32]][sll_circular_create_~last~0.offset] == s)) && ~bvadd64(i, 1bv32) == len) && #memory_$Pointer$[s][s] == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && ~bvadd64(i, 4294967295bv32) == 0bv32) || (((((s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32) && #memory_$Pointer$[s][s] == 0bv32) && !(#memory_$Pointer$[s][0bv32] == s)) && ~bvadd64(len, 4294967294bv32) == i) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len))) || ((((((~bvadd64(~bvmul32(2bv32, len), 4294967294bv32) == new_data && s == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 4bv32)], 2bv32) == ~bvmul32(2bv32, len)) && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(len, 4294967293bv32) == i) && #memory_$Pointer$[s][s] == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len)) - InvariantResult [Line: 596]: Loop Invariant [2018-12-09 08:55:38,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_9,QUANTIFIED] [2018-12-09 08:55:38,040 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,040 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,040 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,040 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,040 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,040 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,041 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-09 08:55:38,041 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-09 08:55:38,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-09 08:55:38,041 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-09 08:55:38,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_9,QUANTIFIED] [2018-12-09 08:55:38,043 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,043 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,043 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,043 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,043 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,044 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-12-09 08:55:38,044 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-09 08:55:38,044 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-09 08:55:38,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-09 08:55:38,044 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-12-09 08:55:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,045 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((forall v_main_~s~0.base_BEFORE_CALL_9 : bv32 :: !(~bvadd64(unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_9][4bv32], 4294967294bv32) == 0bv32)) || (((~bvsgt32(~bvadd64(index, 1bv32), 0bv32) && #memory_$Pointer$[head][head] == head) && head == #memory_$Pointer$[head][head]) && ~bvadd64(index, 1bv32) == \old(index))) || (forall v_main_~s~0.base_BEFORE_CALL_7 : bv32, v_main_~s~0.offset_BEFORE_CALL_7 : bv32 :: (!(#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] == 0bv32) || !(3bv32 == unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7]][~bvadd64(#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7], 4bv32)])) || #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7] == v_main_~s~0.base_BEFORE_CALL_7)) || ~bvsgt32(~bvadd64(\old(index), 4294967295bv32), 0bv32)) || (forall v_main_~s~0.base_BEFORE_CALL_3 : bv32 :: !(3bv32 == unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0bv32]][~bvadd64(#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0bv32], 4bv32)]) || v_main_~s~0.base_BEFORE_CALL_3 == #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][0bv32])) || ((index == \old(index) && head == head) && head == head) - InvariantResult [Line: 609]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 603]: Loop Invariant [2018-12-09 08:55:38,046 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,046 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,046 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,046 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,046 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,046 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,046 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,046 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,046 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,052 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,052 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,053 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,053 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,053 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,053 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,053 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,054 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,054 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,054 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,054 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,054 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,054 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,054 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,054 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,063 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((index == \old(index) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) || (((~bvsgt32(\old(index), 0bv32) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$)) && (((((head == head && head == head) && index == \old(index)) && \old(data) == data) || (~bvsgt32(\old(index), 0bv32) && ~bvsgt32(~bvadd64(\old(index), 4294967295bv32), 0bv32))) || (((~bvadd64(index, 1bv32) == \old(index) && #memory_$Pointer$[head][head] == head) && \old(data) == data) && #memory_$Pointer$[head][head] == head)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant [2018-12-09 08:55:38,064 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,064 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,064 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,064 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,064 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,064 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,065 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,065 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,065 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,074 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,075 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,075 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,075 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,076 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,076 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,076 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,076 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,076 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-09 08:55:38,076 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-09 08:55:38,076 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,076 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,076 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,076 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,077 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,085 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:55:38,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-09 08:55:38,086 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((~bvadd64(~bvmul32(2bv32, len), 4294967294bv32) == new_data && s == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 4bv32)], 2bv32) == ~bvmul32(2bv32, len)) && ~bvadd64(i, 1bv32) == len) && #memory_$Pointer$[s][s] == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len)) && ~bvadd64(i, 4294967295bv32) == 0bv32) || (((((((~bvadd64(~bvmul32(2bv32, len), 4294967294bv32) == new_data && s == 0bv32) && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 4bv32)], 2bv32) == ~bvmul32(2bv32, len)) && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(expected, 4294967294bv32) == 0bv32) && #memory_$Pointer$[s][s] == 0bv32) && ~bvadd64(len, 4294967293bv32) == i) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len))) || ((((((s == 0bv32 && ~bvadd64(unknown-#memory_int-unknown[s][~bvadd64(s, 4bv32)], 2bv32) == ~bvmul32(2bv32, len)) && ~bvadd64(len, 4294967294bv32) == 0bv32) && ~bvadd64(len, i) == new_data) && #memory_$Pointer$[s][s] == 0bv32) && ~bvadd64(len, 4294967294bv32) == i) && ~bvadd64(unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][~bvadd64(#memory_$Pointer$[s][s], 4bv32)], 1bv32) == ~bvadd64(~bvneg32(~bvneg32(len)), len)) - InvariantResult [Line: 561]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 59 locations, 1 error locations. SAFE Result, 146.1s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 115.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 522 SDtfs, 779 SDslu, 3440 SDs, 0 SdLazy, 3358 SolverSat, 489 SolverUnsat, 43 SolverUnknown, 0 SolverNotchecked, 69.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1925 GetRequests, 1631 SyntacticMatches, 21 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3076 ImplicationChecksByTransitivity, 66.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=8, 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, 12 MinimizatonAttempts, 77 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 109 PreInvPairs, 191 NumberOfFragments, 995 HoareAnnotationTreeSize, 109 FomulaSimplifications, 6473 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 25 FomulaSimplificationsInter, 1548 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 1062 NumberOfCodeBlocks, 1035 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1805 ConstructedInterpolants, 56 QuantifiedInterpolants, 482237 SizeOfPredicates, 134 NumberOfNonLiveVariables, 3531 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 32 InterpolantComputations, 6 PerfectInterpolantSequences, 546/663 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...