./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f7cafa734d0f20d504408b2e981cc49af978383 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f7cafa734d0f20d504408b2e981cc49af978383 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:56:08,981 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:56:08,982 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:56:08,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:56:08,992 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:56:08,992 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:56:08,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:56:08,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:56:08,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:56:08,997 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:56:08,998 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:56:08,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:56:08,999 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:56:09,000 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:56:09,001 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:56:09,001 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:56:09,003 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:56:09,004 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:56:09,005 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:56:09,007 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:56:09,008 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:56:09,009 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:56:09,011 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:56:09,011 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:56:09,011 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:56:09,012 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:56:09,013 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:56:09,013 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:56:09,014 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:56:09,015 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:56:09,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:56:09,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:56:09,016 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:56:09,016 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:56:09,017 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:56:09,018 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:56:09,019 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 19:56:09,030 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:56:09,030 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:56:09,030 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:56:09,031 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:56:09,031 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:56:09,031 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:56:09,031 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:56:09,032 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:56:09,032 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:56:09,032 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:56:09,032 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:56:09,032 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:56:09,032 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:56:09,032 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:56:09,032 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:56:09,033 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:56:09,033 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:56:09,033 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:56:09,033 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:56:09,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:56:09,033 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:56:09,033 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:56:09,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:56:09,036 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:56:09,036 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:56:09,036 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:56:09,036 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:56:09,036 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:56:09,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:56:09,038 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_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f7cafa734d0f20d504408b2e981cc49af978383 [2018-10-26 19:56:09,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:56:09,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:56:09,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:56:09,081 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:56:09,081 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:56:09,082 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:56:09,125 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/data/60ebe73b4/1bf3d8869e284733acabe9221ba02717/FLAGe2c3821d9 [2018-10-26 19:56:09,551 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:56:09,551 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:56:09,563 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/data/60ebe73b4/1bf3d8869e284733acabe9221ba02717/FLAGe2c3821d9 [2018-10-26 19:56:09,574 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/data/60ebe73b4/1bf3d8869e284733acabe9221ba02717 [2018-10-26 19:56:09,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:56:09,578 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:56:09,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:56:09,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:56:09,583 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:56:09,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:56:09" (1/1) ... [2018-10-26 19:56:09,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584f1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:56:09, skipping insertion in model container [2018-10-26 19:56:09,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:56:09" (1/1) ... [2018-10-26 19:56:09,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:56:09,632 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:56:09,859 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:56:09,868 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:56:09,931 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:56:09,973 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:56:09,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:56:09 WrapperNode [2018-10-26 19:56:09,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:56:09,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:56:09,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:56:09,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:56:10,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:56:09" (1/1) ... [2018-10-26 19:56:10,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:56:09" (1/1) ... [2018-10-26 19:56:10,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:56:09" (1/1) ... [2018-10-26 19:56:10,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:56:09" (1/1) ... [2018-10-26 19:56:10,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:56:09" (1/1) ... [2018-10-26 19:56:10,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:56:09" (1/1) ... [2018-10-26 19:56:10,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:56:09" (1/1) ... [2018-10-26 19:56:10,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:56:10,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:56:10,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:56:10,099 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:56:10,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:56:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:56:10,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:56:10,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:56:10,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-10-26 19:56:10,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-10-26 19:56:10,151 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 19:56:10,151 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-26 19:56:10,151 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-10-26 19:56:10,151 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-10-26 19:56:10,152 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-10-26 19:56:10,152 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:56:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 19:56:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-10-26 19:56:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-10-26 19:56:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-26 19:56:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-26 19:56:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-26 19:56:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-26 19:56:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-26 19:56:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-26 19:56:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-26 19:56:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-26 19:56:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-26 19:56:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-26 19:56:10,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-26 19:56:10,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-26 19:56:10,155 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-26 19:56:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-26 19:56:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-26 19:56:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-26 19:56:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-26 19:56:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-26 19:56:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-26 19:56:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-26 19:56:10,156 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-26 19:56:10,157 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-26 19:56:10,157 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-26 19:56:10,157 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-26 19:56:10,157 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-26 19:56:10,157 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-26 19:56:10,157 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-26 19:56:10,157 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-26 19:56:10,157 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-26 19:56:10,158 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-26 19:56:10,158 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-26 19:56:10,158 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-26 19:56:10,158 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-26 19:56:10,158 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-26 19:56:10,158 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-26 19:56:10,158 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-26 19:56:10,158 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-26 19:56:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-26 19:56:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-26 19:56:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-26 19:56:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-26 19:56:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-26 19:56:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-26 19:56:10,159 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-26 19:56:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-26 19:56:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-26 19:56:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-26 19:56:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-26 19:56:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-26 19:56:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-26 19:56:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-26 19:56:10,160 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-26 19:56:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-26 19:56:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-26 19:56:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-26 19:56:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-26 19:56:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-26 19:56:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-26 19:56:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-10-26 19:56:10,161 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-26 19:56:10,162 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-26 19:56:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-10-26 19:56:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-26 19:56:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:56:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-10-26 19:56:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-26 19:56:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-26 19:56:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-26 19:56:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-26 19:56:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-26 19:56:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-26 19:56:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-26 19:56:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-26 19:56:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-26 19:56:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-26 19:56:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-26 19:56:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-26 19:56:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-26 19:56:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-26 19:56:10,165 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-26 19:56:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-26 19:56:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-26 19:56:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-26 19:56:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-26 19:56:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-26 19:56:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-26 19:56:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-26 19:56:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-26 19:56:10,166 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-26 19:56:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-26 19:56:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-26 19:56:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-26 19:56:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-26 19:56:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-26 19:56:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-26 19:56:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-26 19:56:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-26 19:56:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-26 19:56:10,167 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-26 19:56:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-26 19:56:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-26 19:56:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-26 19:56:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-26 19:56:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-26 19:56:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-26 19:56:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-26 19:56:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-26 19:56:10,168 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-10-26 19:56:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-10-26 19:56:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-26 19:56:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-26 19:56:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-10-26 19:56:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:56:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-26 19:56:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:56:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:56:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-26 19:56:10,825 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:56:10,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:56:10 BoogieIcfgContainer [2018-10-26 19:56:10,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:56:10,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:56:10,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:56:10,829 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:56:10,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:56:09" (1/3) ... [2018-10-26 19:56:10,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208d1b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:56:10, skipping insertion in model container [2018-10-26 19:56:10,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:56:09" (2/3) ... [2018-10-26 19:56:10,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208d1b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:56:10, skipping insertion in model container [2018-10-26 19:56:10,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:56:10" (3/3) ... [2018-10-26 19:56:10,832 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:56:10,841 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:56:10,848 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:56:10,861 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:56:10,886 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:56:10,886 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:56:10,886 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:56:10,887 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:56:10,887 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:56:10,887 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:56:10,887 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:56:10,887 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:56:10,887 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:56:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-10-26 19:56:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 19:56:10,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:56:10,910 INFO L375 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, 1] [2018-10-26 19:56:10,912 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:56:10,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:56:10,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1638660761, now seen corresponding path program 1 times [2018-10-26 19:56:10,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:56:10,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:56:10,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:10,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:10,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:11,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:56:11,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:56:11,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 19:56:11,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 19:56:11,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:56:11,096 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-10-26 19:56:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:56:11,116 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2018-10-26 19:56:11,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 19:56:11,118 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 41 [2018-10-26 19:56:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:56:11,124 INFO L225 Difference]: With dead ends: 142 [2018-10-26 19:56:11,124 INFO L226 Difference]: Without dead ends: 57 [2018-10-26 19:56:11,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:56:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-26 19:56:11,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-26 19:56:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-26 19:56:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-10-26 19:56:11,166 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 41 [2018-10-26 19:56:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:56:11,167 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-10-26 19:56:11,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 19:56:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-10-26 19:56:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 19:56:11,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:56:11,169 INFO L375 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, 1, 1, 1, 1] [2018-10-26 19:56:11,169 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:56:11,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:56:11,169 INFO L82 PathProgramCache]: Analyzing trace with hash 227048233, now seen corresponding path program 1 times [2018-10-26 19:56:11,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:56:11,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:56:11,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:11,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:11,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:11,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:56:11,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:56:11,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:56:11,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:56:11,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:56:11,303 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 3 states. [2018-10-26 19:56:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:56:11,361 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-10-26 19:56:11,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:56:11,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-26 19:56:11,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:56:11,366 INFO L225 Difference]: With dead ends: 78 [2018-10-26 19:56:11,366 INFO L226 Difference]: Without dead ends: 63 [2018-10-26 19:56:11,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:56:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-26 19:56:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-10-26 19:56:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-26 19:56:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-10-26 19:56:11,374 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 44 [2018-10-26 19:56:11,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:56:11,376 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-10-26 19:56:11,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:56:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-10-26 19:56:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 19:56:11,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:56:11,377 INFO L375 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, 1, 1, 1, 1] [2018-10-26 19:56:11,377 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:56:11,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:56:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1458379063, now seen corresponding path program 1 times [2018-10-26 19:56:11,379 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:56:11,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:56:11,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:11,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:11,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:56:11,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:56:11,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:56:11,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:56:11,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:56:11,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:56:11,514 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 5 states. [2018-10-26 19:56:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:56:11,571 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-10-26 19:56:11,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:56:11,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-26 19:56:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:56:11,574 INFO L225 Difference]: With dead ends: 111 [2018-10-26 19:56:11,574 INFO L226 Difference]: Without dead ends: 67 [2018-10-26 19:56:11,574 INFO L605 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-10-26 19:56:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-26 19:56:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-10-26 19:56:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-26 19:56:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-10-26 19:56:11,581 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 44 [2018-10-26 19:56:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:56:11,581 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-10-26 19:56:11,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:56:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-10-26 19:56:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-26 19:56:11,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:56:11,583 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:56:11,583 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:56:11,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:56:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash 60923689, now seen corresponding path program 1 times [2018-10-26 19:56:11,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:56:11,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:56:11,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:11,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:11,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 19:56:11,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:56:11,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:56:11,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:56:11,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:56:11,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:56:11,701 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 5 states. [2018-10-26 19:56:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:56:11,903 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-10-26 19:56:11,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:56:11,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-10-26 19:56:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:56:11,905 INFO L225 Difference]: With dead ends: 79 [2018-10-26 19:56:11,905 INFO L226 Difference]: Without dead ends: 63 [2018-10-26 19:56:11,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:56:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-26 19:56:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-10-26 19:56:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-26 19:56:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-10-26 19:56:11,911 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 60 [2018-10-26 19:56:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:56:11,912 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-10-26 19:56:11,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:56:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-10-26 19:56:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 19:56:11,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:56:11,913 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:56:11,913 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:56:11,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:56:11,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1117673346, now seen corresponding path program 1 times [2018-10-26 19:56:11,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:56:11,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:56:11,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:11,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:11,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 19:56:12,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:56:12,180 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:56:12,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:12,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:56:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 19:56:12,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:56:12,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-26 19:56:12,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 19:56:12,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 19:56:12,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:56:12,338 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 6 states. [2018-10-26 19:56:12,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:56:12,715 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2018-10-26 19:56:12,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 19:56:12,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-10-26 19:56:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:56:12,717 INFO L225 Difference]: With dead ends: 116 [2018-10-26 19:56:12,717 INFO L226 Difference]: Without dead ends: 73 [2018-10-26 19:56:12,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:56:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-26 19:56:12,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-10-26 19:56:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-26 19:56:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-10-26 19:56:12,724 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 64 [2018-10-26 19:56:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:56:12,725 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-10-26 19:56:12,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 19:56:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-10-26 19:56:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 19:56:12,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:56:12,726 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:56:12,726 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:56:12,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:56:12,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1945968610, now seen corresponding path program 2 times [2018-10-26 19:56:12,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:56:12,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:56:12,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:12,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:12,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:13,175 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 19:56:13,347 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 19:56:14,765 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-10-26 19:56:15,327 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-10-26 19:56:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:56:15,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:56:15,757 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:56:15,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 19:56:15,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 19:56:15,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:56:15,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:56:15,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 19:56:15,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:15,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:15,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 19:56:16,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:56:16,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10-26 19:56:16,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:16,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:16,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:16,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-10-26 19:56:17,132 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:17,133 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:17,134 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-26 19:56:17,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:17,170 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 79 [2018-10-26 19:56:17,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-10-26 19:56:17,178 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:17,244 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:17,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 80 [2018-10-26 19:56:17,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:17,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 66 [2018-10-26 19:56:17,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 62 treesize of output 61 [2018-10-26 19:56:17,341 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:17,383 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:17,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 74 [2018-10-26 19:56:17,392 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:17,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 66 [2018-10-26 19:56:17,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-10-26 19:56:17,507 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:17,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 73 [2018-10-26 19:56:17,516 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:18,113 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:18,134 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:18,217 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:18,220 INFO L477 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 64 treesize of output 55 [2018-10-26 19:56:18,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:18,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 70 [2018-10-26 19:56:18,237 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:18,265 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:18,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:18,272 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:18,273 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:18,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 58 treesize of output 68 [2018-10-26 19:56:18,278 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:18,296 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 96 [2018-10-26 19:56:18,301 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-10-26 19:56:18,414 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-10-26 19:56:18,618 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 9 xjuncts. [2018-10-26 19:56:18,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 65 [2018-10-26 19:56:19,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 51 [2018-10-26 19:56:19,006 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:19,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 59 treesize of output 58 [2018-10-26 19:56:19,059 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:19,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-10-26 19:56:19,122 INFO L477 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 16 treesize of output 23 [2018-10-26 19:56:19,122 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:19,134 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:19,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-10-26 19:56:19,146 INFO L477 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 16 treesize of output 23 [2018-10-26 19:56:19,147 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:19,158 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:19,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 59 [2018-10-26 19:56:19,252 INFO L477 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 49 treesize of output 56 [2018-10-26 19:56:19,252 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:19,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:19,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 68 [2018-10-26 19:56:19,298 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:19,339 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:56:19,418 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-26 19:56:19,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-26 19:56:19,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-26 19:56:19,523 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:146, output treesize:165 [2018-10-26 19:56:19,631 INFO L477 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 1 case distinctions, treesize of input 48 treesize of output 38 [2018-10-26 19:56:19,634 INFO L477 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 34 treesize of output 26 [2018-10-26 19:56:19,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:19,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-26 19:56:19,645 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:19,654 INFO L477 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 30 treesize of output 19 [2018-10-26 19:56:19,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:19,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:19,673 INFO L477 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 28 treesize of output 22 [2018-10-26 19:56:19,675 INFO L477 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 18 treesize of output 9 [2018-10-26 19:56:19,676 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:19,679 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:19,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:19,689 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:77, output treesize:4 [2018-10-26 19:56:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:56:19,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:56:19,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 55 [2018-10-26 19:56:19,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-26 19:56:19,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-26 19:56:19,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2790, Unknown=23, NotChecked=0, Total=2970 [2018-10-26 19:56:19,730 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 55 states. [2018-10-26 19:56:23,837 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2018-10-26 19:56:24,062 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 70 [2018-10-26 19:56:24,433 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2018-10-26 19:56:24,717 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2018-10-26 19:56:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:56:26,079 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-10-26 19:56:26,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-26 19:56:26,083 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 80 [2018-10-26 19:56:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:56:26,084 INFO L225 Difference]: With dead ends: 101 [2018-10-26 19:56:26,084 INFO L226 Difference]: Without dead ends: 98 [2018-10-26 19:56:26,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=321, Invalid=5334, Unknown=45, NotChecked=0, Total=5700 [2018-10-26 19:56:26,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-26 19:56:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2018-10-26 19:56:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-26 19:56:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-10-26 19:56:26,108 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 80 [2018-10-26 19:56:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:56:26,109 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-10-26 19:56:26,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-26 19:56:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-10-26 19:56:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 19:56:26,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:56:26,110 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:56:26,110 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:56:26,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:56:26,111 INFO L82 PathProgramCache]: Analyzing trace with hash 260541314, now seen corresponding path program 1 times [2018-10-26 19:56:26,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:56:26,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:56:26,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:26,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 19:56:26,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:27,021 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-10-26 19:56:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:56:27,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:56:27,130 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:56:27,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:27,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:56:27,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:56:27,387 INFO L477 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-10-26 19:56:27,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:27,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:27,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:27,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-10-26 19:56:28,181 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 1 [2018-10-26 19:56:28,181 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:28,182 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:92, output treesize:1 [2018-10-26 19:56:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:56:28,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:56:28,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 38 [2018-10-26 19:56:28,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-26 19:56:28,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-26 19:56:28,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1277, Unknown=3, NotChecked=0, Total=1406 [2018-10-26 19:56:28,207 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 38 states. [2018-10-26 19:56:28,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:56:28,946 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-10-26 19:56:28,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-26 19:56:28,950 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-10-26 19:56:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:56:28,951 INFO L225 Difference]: With dead ends: 96 [2018-10-26 19:56:28,951 INFO L226 Difference]: Without dead ends: 81 [2018-10-26 19:56:28,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=221, Invalid=2325, Unknown=4, NotChecked=0, Total=2550 [2018-10-26 19:56:28,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-26 19:56:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-26 19:56:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-26 19:56:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-10-26 19:56:28,963 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 80 [2018-10-26 19:56:28,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:56:28,963 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-10-26 19:56:28,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-26 19:56:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-10-26 19:56:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 19:56:28,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:56:28,965 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:56:28,965 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:56:28,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:56:28,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1072962651, now seen corresponding path program 1 times [2018-10-26 19:56:28,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:56:28,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:56:28,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:28,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:30,503 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-10-26 19:56:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 19:56:31,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:56:31,386 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:56:31,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:31,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:56:31,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 19:56:31,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:31,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:31,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-26 19:56:31,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:56:31,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:56:31,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:31,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:31,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:31,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-10-26 19:56:32,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:56:32,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:56:32,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:32,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:32,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:56:32,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:56:32,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:32,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:32,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:32,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-10-26 19:56:33,683 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 61 [2018-10-26 19:56:33,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:33,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:33,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-26 19:56:33,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:33,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 171 [2018-10-26 19:56:33,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 177 [2018-10-26 19:56:33,809 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:34,162 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:34,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 180 [2018-10-26 19:56:34,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:34,777 INFO L477 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 176 treesize of output 154 [2018-10-26 19:56:34,784 INFO L477 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 158 treesize of output 157 [2018-10-26 19:56:34,785 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:34,964 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:34,965 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:34,965 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:34,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 137 treesize of output 178 [2018-10-26 19:56:34,971 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:35,219 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 154 [2018-10-26 19:56:35,225 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:35,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 143 [2018-10-26 19:56:35,235 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:35,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 169 [2018-10-26 19:56:35,261 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:35,327 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:35,379 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:35,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:35,539 INFO L477 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 155 treesize of output 154 [2018-10-26 19:56:35,551 INFO L477 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 22 treesize of output 35 [2018-10-26 19:56:35,552 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:35,603 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:35,738 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:56:36,314 INFO L303 Elim1Store]: Index analysis took 262 ms [2018-10-26 19:56:36,550 INFO L477 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 173 treesize of output 153 [2018-10-26 19:56:36,567 INFO L477 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 155 treesize of output 154 [2018-10-26 19:56:36,568 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:36,786 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:36,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 150 [2018-10-26 19:56:36,789 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:56:36,817 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:56:37,094 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:37,104 INFO L477 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 156 treesize of output 155 [2018-10-26 19:56:37,115 INFO L477 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 16 treesize of output 23 [2018-10-26 19:56:37,115 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:37,149 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:37,524 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 153 [2018-10-26 19:56:37,543 INFO L477 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 153 treesize of output 160 [2018-10-26 19:56:37,544 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:37,648 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:37,650 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:37,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 164 [2018-10-26 19:56:37,686 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:37,779 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:38,072 INFO L477 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 149 treesize of output 148 [2018-10-26 19:56:38,087 INFO L477 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 148 treesize of output 155 [2018-10-26 19:56:38,088 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:38,178 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:38,179 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:38,180 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:38,181 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:38,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 198 [2018-10-26 19:56:38,220 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:38,362 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 19:56:38,505 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:38,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:38,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 134 [2018-10-26 19:56:38,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 128 [2018-10-26 19:56:38,683 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:38,863 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:38,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 131 [2018-10-26 19:56:38,864 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:39,074 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 121 [2018-10-26 19:56:39,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 109 [2018-10-26 19:56:39,099 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:39,195 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:39,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 129 [2018-10-26 19:56:39,198 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:39,283 INFO L477 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 112 treesize of output 115 [2018-10-26 19:56:39,291 INFO L477 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 16 treesize of output 23 [2018-10-26 19:56:39,291 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:39,330 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:39,430 INFO L477 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 1 case distinctions, treesize of input 101 treesize of output 96 [2018-10-26 19:56:39,439 INFO L477 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 16 treesize of output 23 [2018-10-26 19:56:39,439 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:39,460 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:39,551 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:39,742 INFO L477 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 118 [2018-10-26 19:56:39,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 108 [2018-10-26 19:56:39,748 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:39,840 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:39,841 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:39,841 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:39,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 100 treesize of output 137 [2018-10-26 19:56:39,845 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:40,253 INFO L477 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 3 case distinctions, treesize of input 108 treesize of output 112 [2018-10-26 19:56:40,259 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:40,259 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:40,268 INFO L477 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 2 case distinctions, treesize of input 97 treesize of output 123 [2018-10-26 19:56:40,268 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:40,341 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:56:40,425 INFO L477 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 106 treesize of output 101 [2018-10-26 19:56:40,453 INFO L477 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 16 treesize of output 23 [2018-10-26 19:56:40,453 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:40,473 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:40,591 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:56:40,704 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:40,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 132 [2018-10-26 19:56:40,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 126 [2018-10-26 19:56:40,727 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:40,942 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:40,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 129 [2018-10-26 19:56:40,943 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:41,148 INFO L477 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 116 [2018-10-26 19:56:41,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 106 [2018-10-26 19:56:41,153 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:41,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:41,237 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:41,238 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:41,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 98 treesize of output 135 [2018-10-26 19:56:41,239 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:41,328 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:41,370 INFO L477 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 4 case distinctions, treesize of input 101 treesize of output 112 [2018-10-26 19:56:41,390 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 3 xjuncts. [2018-10-26 19:56:41,508 INFO L477 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 4 case distinctions, treesize of input 98 treesize of output 102 [2018-10-26 19:56:41,511 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:41,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:41,513 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:41,515 INFO L477 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 87 treesize of output 100 [2018-10-26 19:56:41,515 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:41,540 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:41,584 INFO L477 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 106 treesize of output 101 [2018-10-26 19:56:41,587 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:41,588 INFO L477 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 16 treesize of output 15 [2018-10-26 19:56:41,588 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:41,600 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:41,628 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:41,814 INFO L477 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 115 [2018-10-26 19:56:41,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 103 [2018-10-26 19:56:41,824 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:41,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:41,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 131 [2018-10-26 19:56:41,915 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,013 INFO L477 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 3 case distinctions, treesize of input 103 treesize of output 109 [2018-10-26 19:56:42,016 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:42,018 INFO L477 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 102 treesize of output 96 [2018-10-26 19:56:42,018 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,072 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:42,073 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:42,073 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:42,075 INFO L477 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 87 treesize of output 100 [2018-10-26 19:56:42,076 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,103 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,181 INFO L477 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 4 case distinctions, treesize of input 98 treesize of output 102 [2018-10-26 19:56:42,184 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:42,186 INFO L477 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 97 treesize of output 91 [2018-10-26 19:56:42,186 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,242 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:42,243 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:42,243 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:42,244 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:42,244 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:42,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 88 treesize of output 126 [2018-10-26 19:56:42,248 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,297 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:42,334 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,357 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,404 INFO L477 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 95 treesize of output 106 [2018-10-26 19:56:42,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 19:56:42,407 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,420 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,424 INFO L477 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 104 treesize of output 115 [2018-10-26 19:56:42,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 19:56:42,427 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,441 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:42,480 INFO L202 ElimStorePlain]: Needed 66 recursive calls to eliminate 9 variables, input treesize:330, output treesize:194 [2018-10-26 19:56:42,635 INFO L477 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 78 treesize of output 72 [2018-10-26 19:56:42,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2018-10-26 19:56:42,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,690 INFO L477 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 41 treesize of output 41 [2018-10-26 19:56:42,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-10-26 19:56:42,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-10-26 19:56:42,709 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,724 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:42,725 INFO L477 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 0 case distinctions, treesize of input 33 treesize of output 28 [2018-10-26 19:56:42,725 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,753 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:199, output treesize:17 [2018-10-26 19:56:42,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 19:56:42,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 19:56:42,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:42,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2018-10-26 19:56:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 19:56:42,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:56:42,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 34] total 68 [2018-10-26 19:56:42,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-26 19:56:42,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-26 19:56:42,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4286, Unknown=30, NotChecked=0, Total=4556 [2018-10-26 19:56:42,959 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 68 states. [2018-10-26 19:56:44,355 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2018-10-26 19:56:44,589 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2018-10-26 19:56:44,924 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2018-10-26 19:56:47,728 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-10-26 19:56:48,496 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-10-26 19:56:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:56:50,222 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2018-10-26 19:56:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-26 19:56:50,223 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 83 [2018-10-26 19:56:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:56:50,225 INFO L225 Difference]: With dead ends: 138 [2018-10-26 19:56:50,225 INFO L226 Difference]: Without dead ends: 136 [2018-10-26 19:56:50,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3103 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=608, Invalid=10054, Unknown=50, NotChecked=0, Total=10712 [2018-10-26 19:56:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-26 19:56:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 85. [2018-10-26 19:56:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-26 19:56:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-10-26 19:56:50,243 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 83 [2018-10-26 19:56:50,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:56:50,244 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-10-26 19:56:50,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-26 19:56:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-10-26 19:56:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-26 19:56:50,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:56:50,245 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:56:50,245 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:56:50,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:56:50,250 INFO L82 PathProgramCache]: Analyzing trace with hash -694915237, now seen corresponding path program 3 times [2018-10-26 19:56:50,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:56:50,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:56:50,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:50,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:50,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 19:56:50,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:56:50,445 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:56:50,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 19:56:50,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 19:56:50,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:56:50,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:56:50,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:56:50,585 INFO L477 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-10-26 19:56:50,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:50,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:50,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:56:50,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-10-26 19:56:50,861 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_insert_~new_node~0.base Int) (sll_insert_~snd_to_last~0.offset Int) (sll_insert_~last~0.base Int) (sll_insert_~snd_to_last~0.base Int) (sll_insert_~new_node~0.offset Int)) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) 4 0)))) (store .cse1 sll_insert_~snd_to_last~0.base (store (select .cse1 sll_insert_~snd_to_last~0.base) (+ sll_insert_~snd_to_last~0.offset 4) sll_insert_~new_node~0.base))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (+ sll_insert_~new_node~0.offset 4) sll_insert_~last~0.base)))) (not (= 0 sll_insert_~new_node~0.base)) (<= 0 sll_insert_~new_node~0.offset))) is different from true [2018-10-26 19:56:50,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 65 [2018-10-26 19:56:50,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-10-26 19:56:50,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:50,955 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:50,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-10-26 19:56:50,956 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:51,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 55 [2018-10-26 19:56:51,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 66 [2018-10-26 19:56:51,059 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-26 19:56:51,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 46 treesize of output 45 [2018-10-26 19:56:51,159 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:51,238 INFO L477 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 3 case distinctions, treesize of input 44 treesize of output 50 [2018-10-26 19:56:51,243 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:51,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 90 [2018-10-26 19:56:51,263 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-10-26 19:56:51,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:51,371 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:51,374 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:51,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 77 [2018-10-26 19:56:51,387 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-26 19:56:51,545 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-10-26 19:56:51,722 INFO L477 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 3 case distinctions, treesize of input 41 treesize of output 49 [2018-10-26 19:56:51,726 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:51,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 60 [2018-10-26 19:56:51,736 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:51,844 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:51,845 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:51,848 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:51,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 77 [2018-10-26 19:56:51,863 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-10-26 19:56:51,914 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 19:56:51,980 INFO L477 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 42 treesize of output 35 [2018-10-26 19:56:51,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:51,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:51,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 47 [2018-10-26 19:56:51,996 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:52,014 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:52,065 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-26 19:56:52,211 INFO L477 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 69 [2018-10-26 19:56:52,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 51 [2018-10-26 19:56:52,232 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:53,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 66 [2018-10-26 19:56:53,214 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-10-26 19:56:54,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 47 treesize of output 46 [2018-10-26 19:56:54,471 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-26 19:56:55,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 54 [2018-10-26 19:56:55,662 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:56,960 INFO L477 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 4 case distinctions, treesize of input 44 treesize of output 50 [2018-10-26 19:56:56,964 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:56,965 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:56,968 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:56,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 77 [2018-10-26 19:56:56,981 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 4 xjuncts. [2018-10-26 19:56:57,039 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 19:56:57,970 INFO L477 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 43 treesize of output 42 [2018-10-26 19:56:57,978 INFO L477 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 18 treesize of output 27 [2018-10-26 19:56:57,978 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-10-26 19:56:57,991 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:56:58,006 INFO L477 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 4 case distinctions, treesize of input 41 treesize of output 49 [2018-10-26 19:56:58,009 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:58,011 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:58,022 INFO L477 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 4 case distinctions, treesize of input 38 treesize of output 65 [2018-10-26 19:56:58,023 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-10-26 19:56:58,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:58,097 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:58,100 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:58,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 77 [2018-10-26 19:56:58,113 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-10-26 19:56:58,164 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 19:56:58,796 INFO L477 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 3 case distinctions, treesize of input 44 treesize of output 50 [2018-10-26 19:56:58,800 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:58,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 90 [2018-10-26 19:56:58,819 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 8 xjuncts. [2018-10-26 19:56:58,929 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:58,930 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:58,933 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:58,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 77 [2018-10-26 19:56:58,946 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 4 xjuncts. [2018-10-26 19:56:59,046 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-10-26 19:56:59,698 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:56:59,716 INFO L477 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 59 [2018-10-26 19:56:59,741 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:59,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 90 [2018-10-26 19:56:59,761 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 8 xjuncts. [2018-10-26 19:56:59,897 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:59,898 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:59,902 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:56:59,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 77 [2018-10-26 19:56:59,915 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-10-26 19:57:00,039 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-26 19:57:00,776 INFO L477 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 67 [2018-10-26 19:57:00,791 INFO L477 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 45 treesize of output 52 [2018-10-26 19:57:00,792 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-10-26 19:57:00,937 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:00,939 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:00,950 INFO L477 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 4 case distinctions, treesize of input 38 treesize of output 65 [2018-10-26 19:57:00,950 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 4 xjuncts. [2018-10-26 19:57:01,017 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:01,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 60 [2018-10-26 19:57:01,025 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-10-26 19:57:01,078 INFO L267 ElimStorePlain]: Start of recursive call 34: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-26 19:57:01,396 INFO L477 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 42 treesize of output 35 [2018-10-26 19:57:01,398 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:01,399 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:01,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 47 [2018-10-26 19:57:01,408 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-10-26 19:57:01,427 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:01,796 INFO L477 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 3 case distinctions, treesize of input 41 treesize of output 49 [2018-10-26 19:57:01,800 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:01,801 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:01,804 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:01,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 77 [2018-10-26 19:57:01,818 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 4 xjuncts. [2018-10-26 19:57:01,885 INFO L477 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 40 treesize of output 47 [2018-10-26 19:57:01,885 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-10-26 19:57:01,924 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 19:57:02,029 INFO L267 ElimStorePlain]: Start of recursive call 16: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-26 19:57:02,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-26 19:57:02,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-10-26 19:57:02,153 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 6 variables, input treesize:84, output treesize:116 [2018-10-26 19:57:02,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-10-26 19:57:02,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-10-26 19:57:02,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:02,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:02,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:02,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-10-26 19:57:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 19:57:02,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:57:02,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2018-10-26 19:57:02,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-26 19:57:02,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-26 19:57:02,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=690, Unknown=2, NotChecked=52, Total=812 [2018-10-26 19:57:02,242 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 29 states. [2018-10-26 19:57:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:57:03,126 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-10-26 19:57:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-26 19:57:03,127 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 84 [2018-10-26 19:57:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:57:03,128 INFO L225 Difference]: With dead ends: 97 [2018-10-26 19:57:03,128 INFO L226 Difference]: Without dead ends: 73 [2018-10-26 19:57:03,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=2434, Unknown=17, NotChecked=100, Total=2756 [2018-10-26 19:57:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-26 19:57:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-26 19:57:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-26 19:57:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-10-26 19:57:03,137 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 84 [2018-10-26 19:57:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:57:03,138 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-10-26 19:57:03,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-26 19:57:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-10-26 19:57:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 19:57:03,138 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:57:03,139 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:57:03,139 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:57:03,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:57:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1482629234, now seen corresponding path program 1 times [2018-10-26 19:57:03,139 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:57:03,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:57:03,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:57:03,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 19:57:03,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:57:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:04,219 WARN L179 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-10-26 19:57:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-26 19:57:05,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:57:05,412 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:57:05,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:57:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:05,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:57:05,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 19:57:05,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:05,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:05,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 19:57:05,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:57:05,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:57:05,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:05,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:06,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:57:06,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:57:06,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:06,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:06,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:06,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-10-26 19:57:08,474 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 50 [2018-10-26 19:57:08,479 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:08,481 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:08,482 INFO L477 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 15 treesize of output 8 [2018-10-26 19:57:08,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:08,549 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 169 [2018-10-26 19:57:08,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 165 [2018-10-26 19:57:08,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:08,885 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:08,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 168 [2018-10-26 19:57:08,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:09,145 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 146 [2018-10-26 19:57:09,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-26 19:57:09,148 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:09,174 INFO L477 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 134 treesize of output 129 [2018-10-26 19:57:09,197 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:09,198 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:09,213 INFO L477 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 2 case distinctions, treesize of input 121 treesize of output 149 [2018-10-26 19:57:09,213 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-26 19:57:09,259 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:09,296 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:09,658 INFO L477 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 164 treesize of output 161 [2018-10-26 19:57:09,663 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:09,664 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:09,665 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:09,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 143 treesize of output 186 [2018-10-26 19:57:09,669 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:09,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 145 [2018-10-26 19:57:09,861 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:10,055 INFO L477 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 4 case distinctions, treesize of input 140 treesize of output 148 [2018-10-26 19:57:10,059 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:10,060 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:10,061 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:10,061 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:10,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 173 [2018-10-26 19:57:10,081 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-10-26 19:57:10,182 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:57:10,488 INFO L477 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 4 case distinctions, treesize of input 137 treesize of output 147 [2018-10-26 19:57:10,492 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:10,493 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:10,507 INFO L477 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 2 case distinctions, treesize of input 132 treesize of output 160 [2018-10-26 19:57:10,508 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-10-26 19:57:10,555 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:10,653 INFO L477 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 149 treesize of output 152 [2018-10-26 19:57:10,662 INFO L477 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 16 treesize of output 23 [2018-10-26 19:57:10,662 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-10-26 19:57:10,685 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:10,746 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:57:11,002 INFO L477 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 161 treesize of output 160 [2018-10-26 19:57:11,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 150 [2018-10-26 19:57:11,023 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:11,240 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:11,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 174 [2018-10-26 19:57:11,242 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:11,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 154 [2018-10-26 19:57:11,467 INFO L477 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 149 treesize of output 156 [2018-10-26 19:57:11,468 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-10-26 19:57:11,577 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:11,579 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:11,738 INFO L477 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 2 case distinctions, treesize of input 124 treesize of output 152 [2018-10-26 19:57:11,739 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-10-26 19:57:11,848 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-26 19:57:12,131 INFO L477 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 157 treesize of output 160 [2018-10-26 19:57:12,140 INFO L477 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 16 treesize of output 23 [2018-10-26 19:57:12,140 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-10-26 19:57:12,162 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:12,290 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:12,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:12,414 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 117 [2018-10-26 19:57:12,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 115 [2018-10-26 19:57:12,418 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:12,548 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:12,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 118 [2018-10-26 19:57:12,550 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:12,665 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:12,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 118 [2018-10-26 19:57:12,681 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:12,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 103 treesize of output 106 [2018-10-26 19:57:12,682 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 19:57:12,700 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 19:57:12,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2018-10-26 19:57:12,766 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:12,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:12,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:12,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 101 [2018-10-26 19:57:12,835 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:12,872 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 32 treesize of output 77 [2018-10-26 19:57:12,874 INFO L267 ElimStorePlain]: Start of recursive call 35: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-10-26 19:57:12,914 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:12,989 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:12,991 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:12,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 95 [2018-10-26 19:57:12,999 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:13,009 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 50 [2018-10-26 19:57:13,010 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-26 19:57:13,030 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:13,070 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,073 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 92 [2018-10-26 19:57:13,081 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:13,090 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 50 [2018-10-26 19:57:13,091 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-26 19:57:13,110 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:13,129 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:13,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 114 treesize of output 115 [2018-10-26 19:57:13,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 111 treesize of output 107 [2018-10-26 19:57:13,218 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:13,296 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,296 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,297 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:13,299 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 79 treesize of output 115 [2018-10-26 19:57:13,300 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:57:13,318 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:57:13,378 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,381 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 106 [2018-10-26 19:57:13,398 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,399 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,400 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:13,412 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 132 [2018-10-26 19:57:13,413 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-26 19:57:13,466 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:13,517 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,518 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 97 [2018-10-26 19:57:13,524 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:13,534 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 64 [2018-10-26 19:57:13,535 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-26 19:57:13,554 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:13,598 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,602 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 101 [2018-10-26 19:57:13,640 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,641 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:13,642 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:13,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 91 treesize of output 119 [2018-10-26 19:57:13,645 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:57:13,664 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:13,665 INFO L477 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 22 treesize of output 25 [2018-10-26 19:57:13,666 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:13,678 INFO L267 ElimStorePlain]: Start of recursive call 49: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:57:13,731 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-26 19:57:13,795 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-26 19:57:13,872 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 19:57:13,890 INFO L477 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 119 [2018-10-26 19:57:13,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 117 [2018-10-26 19:57:13,894 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:14,001 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:14,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 120 [2018-10-26 19:57:14,003 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:14,132 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:14,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 120 [2018-10-26 19:57:14,194 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:14,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 111 [2018-10-26 19:57:14,196 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:14,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 91 treesize of output 90 [2018-10-26 19:57:14,345 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:14,403 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:14,404 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:14,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 102 [2018-10-26 19:57:14,427 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 56 [2018-10-26 19:57:14,428 INFO L267 ElimStorePlain]: Start of recursive call 59: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-10-26 19:57:14,462 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:14,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:14,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:14,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 86 [2018-10-26 19:57:14,555 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 52 [2018-10-26 19:57:14,556 INFO L267 ElimStorePlain]: Start of recursive call 61: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-10-26 19:57:14,599 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:14,686 INFO L267 ElimStorePlain]: Start of recursive call 55: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:14,773 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:14,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 108 [2018-10-26 19:57:14,778 INFO L477 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 34 treesize of output 30 [2018-10-26 19:57:14,778 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:14,794 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:14,795 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:14,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 55 treesize of output 61 [2018-10-26 19:57:14,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:14,803 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:14,821 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 111 [2018-10-26 19:57:14,824 INFO L267 ElimStorePlain]: Start of recursive call 65: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-10-26 19:57:14,866 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:14,886 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:14,966 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:15,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-26 19:57:15,012 INFO L202 ElimStorePlain]: Needed 65 recursive calls to eliminate 7 variables, input treesize:306, output treesize:285 [2018-10-26 19:57:15,245 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:15,254 INFO L477 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 122 [2018-10-26 19:57:15,282 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:15,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2018-10-26 19:57:15,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,375 INFO L477 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 79 treesize of output 75 [2018-10-26 19:57:15,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2018-10-26 19:57:15,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-10-26 19:57:15,394 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,410 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:15,410 INFO L477 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 0 case distinctions, treesize of input 63 treesize of output 54 [2018-10-26 19:57:15,411 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,444 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:15,446 INFO L477 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 105 treesize of output 87 [2018-10-26 19:57:15,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 48 [2018-10-26 19:57:15,448 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 19:57:15,458 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-10-26 19:57:15,483 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:301, output treesize:136 [2018-10-26 19:57:15,702 INFO L477 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2018-10-26 19:57:15,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-10-26 19:57:15,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,712 INFO L477 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 17 treesize of output 13 [2018-10-26 19:57:15,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,733 INFO L477 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 51 [2018-10-26 19:57:15,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-10-26 19:57:15,736 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,768 INFO L477 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 25 treesize of output 9 [2018-10-26 19:57:15,768 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-10-26 19:57:15,790 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,824 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-10-26 19:57:15,825 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-10-26 19:57:15,838 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,849 INFO L477 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 32 treesize of output 28 [2018-10-26 19:57:15,849 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,864 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-10-26 19:57:15,864 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,866 INFO L267 ElimStorePlain]: Start of recursive call 5: 10 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:15,867 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:1 [2018-10-26 19:57:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:57:15,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:57:15,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 28] total 62 [2018-10-26 19:57:15,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-26 19:57:15,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-26 19:57:15,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3587, Unknown=28, NotChecked=0, Total=3782 [2018-10-26 19:57:15,925 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 62 states. [2018-10-26 19:57:19,567 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 75 [2018-10-26 19:57:20,148 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-10-26 19:57:20,706 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2018-10-26 19:57:20,914 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94 [2018-10-26 19:57:21,143 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2018-10-26 19:57:21,599 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2018-10-26 19:57:21,812 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 99 [2018-10-26 19:57:23,320 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2018-10-26 19:57:23,499 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2018-10-26 19:57:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:57:23,711 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2018-10-26 19:57:23,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-26 19:57:23,711 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 86 [2018-10-26 19:57:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:57:23,712 INFO L225 Difference]: With dead ends: 119 [2018-10-26 19:57:23,712 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 19:57:23,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=594, Invalid=10088, Unknown=30, NotChecked=0, Total=10712 [2018-10-26 19:57:23,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 19:57:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 19:57:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 19:57:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 19:57:23,715 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2018-10-26 19:57:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:57:23,715 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 19:57:23,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-26 19:57:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 19:57:23,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 19:57:23,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 19:57:23,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:24,622 WARN L179 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2018-10-26 19:57:25,033 WARN L179 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 65 [2018-10-26 19:57:25,163 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2018-10-26 19:57:25,748 WARN L179 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 89 [2018-10-26 19:57:25,832 INFO L425 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-10-26 19:57:25,832 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-10-26 19:57:25,832 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-10-26 19:57:25,832 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-10-26 19:57:25,832 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:57:25,832 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-10-26 19:57:25,833 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:57:25,833 INFO L425 ceAbstractionStarter]: For program point L584(line 584) no Hoare annotation was computed. [2018-10-26 19:57:25,833 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-26 19:57:25,833 INFO L425 ceAbstractionStarter]: For program point L584-1(line 584) no Hoare annotation was computed. [2018-10-26 19:57:25,833 INFO L425 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2018-10-26 19:57:25,833 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-10-26 19:57:25,833 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 586) no Hoare annotation was computed. [2018-10-26 19:57:25,833 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-10-26 19:57:25,833 INFO L428 ceAbstractionStarter]: At program point L582-3(lines 582 586) the Hoare annotation is: true [2018-10-26 19:57:25,833 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 581 587) no Hoare annotation was computed. [2018-10-26 19:57:25,833 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2018-10-26 19:57:25,833 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2018-10-26 19:57:25,833 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2018-10-26 19:57:25,833 INFO L425 ceAbstractionStarter]: For program point L576(line 576) no Hoare annotation was computed. [2018-10-26 19:57:25,834 INFO L421 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (or (and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |sll_create_#in~data| sll_create_~data) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (and (= (select (select |#memory_int| sll_create_~new_head~0.base) 0) |sll_create_#in~data|) (= 1 (select |#valid| sll_create_~head~0.base)) (not (= 0 sll_create_~new_head~0.base)) (= |sll_create_#in~data| sll_create_~data) (= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) 0)) (= 1 (select |#valid| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (not (= 0 sll_create_~head~0.base))) (= 0 sll_create_~head~0.offset))) [2018-10-26 19:57:25,834 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-10-26 19:57:25,834 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-10-26 19:57:25,834 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-10-26 19:57:25,834 INFO L425 ceAbstractionStarter]: For program point L574-1(lines 574 578) no Hoare annotation was computed. [2018-10-26 19:57:25,834 INFO L425 ceAbstractionStarter]: For program point L574-3(lines 574 578) no Hoare annotation was computed. [2018-10-26 19:57:25,834 INFO L421 ceAbstractionStarter]: At program point L574-4(lines 574 578) the Hoare annotation is: (or (and (<= sll_create_~data |sll_create_#in~data|) (= |#valid| |old(#valid)|) (<= |sll_create_#in~len| sll_create_~len) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |sll_create_#in~data| sll_create_~data) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (and (and (= (select (select |#memory_int| sll_create_~new_head~0.base) 0) |sll_create_#in~data|) (= 1 (select |#valid| sll_create_~head~0.base)) (= |sll_create_#in~data| sll_create_~data) (= |sll_create_#in~data| (select (select |#memory_int| sll_create_~head~0.base) 0)) (= 1 (select |#valid| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (not (= 0 sll_create_~head~0.base))) (not (= 0 sll_create_~new_head~0.base)) (= 0 sll_create_~head~0.offset))) [2018-10-26 19:57:25,834 INFO L425 ceAbstractionStarter]: For program point L574-5(lines 574 578) no Hoare annotation was computed. [2018-10-26 19:57:25,834 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-10-26 19:57:25,834 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-10-26 19:57:25,834 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2018-10-26 19:57:25,834 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2018-10-26 19:57:25,834 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2018-10-26 19:57:25,834 INFO L421 ceAbstractionStarter]: At program point sll_insertENTRY(lines 588 603) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-10-26 19:57:25,835 INFO L425 ceAbstractionStarter]: For program point L591(line 591) no Hoare annotation was computed. [2018-10-26 19:57:25,835 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-26 19:57:25,835 INFO L421 ceAbstractionStarter]: At program point L589(line 589) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |sll_insert_#in~head.offset| sll_insert_~head.offset) (= |#memory_int| |old(#memory_int)|) (= |sll_insert_#in~head.base| sll_insert_~head.base) (= sll_insert_~index |sll_insert_#in~index|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-10-26 19:57:25,835 INFO L425 ceAbstractionStarter]: For program point sll_insertEXIT(lines 588 603) no Hoare annotation was computed. [2018-10-26 19:57:25,835 INFO L425 ceAbstractionStarter]: For program point L589-1(line 589) no Hoare annotation was computed. [2018-10-26 19:57:25,835 INFO L425 ceAbstractionStarter]: For program point L600(line 600) no Hoare annotation was computed. [2018-10-26 19:57:25,835 INFO L425 ceAbstractionStarter]: For program point L600-1(lines 597 601) no Hoare annotation was computed. [2018-10-26 19:57:25,835 INFO L425 ceAbstractionStarter]: For program point L598(line 598) no Hoare annotation was computed. [2018-10-26 19:57:25,835 INFO L425 ceAbstractionStarter]: For program point L594(line 594) no Hoare annotation was computed. [2018-10-26 19:57:25,835 INFO L425 ceAbstractionStarter]: For program point L594-1(line 594) no Hoare annotation was computed. [2018-10-26 19:57:25,835 INFO L425 ceAbstractionStarter]: For program point L592-1(lines 592 596) no Hoare annotation was computed. [2018-10-26 19:57:25,835 INFO L421 ceAbstractionStarter]: At program point L592-3(lines 592 596) the Hoare annotation is: (let ((.cse14 (@diff |old(#valid)| |#valid|)) (.cse15 (= sll_insert_~head.base sll_insert_~new_node~0.base)) (.cse16 (select |#memory_$Pointer$.offset| sll_insert_~head.base))) (let ((.cse0 (= (select |old(#valid)| sll_insert_~new_node~0.base) 0)) (.cse10 (select (select |#memory_$Pointer$.base| sll_insert_~head.base) sll_insert_~head.offset)) (.cse2 (select (select |#memory_$Pointer$.offset| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|)) (.cse1 (not (= 0 sll_insert_~new_node~0.base))) (.cse3 (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) 4 0)))) (.cse4 (= sll_insert_~head.offset |sll_insert_#in~head.offset|)) (.cse5 (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) 4 0)))) (.cse6 (or .cse15 (and (= (select |old(#memory_$Pointer$.offset)| sll_insert_~head.base) .cse16) (= |sll_insert_#in~head.base| sll_insert_~head.base)))) (.cse13 (<= (+ sll_insert_~index 1) |sll_insert_#in~index|)) (.cse7 (or (not .cse15) (and (= sll_insert_~new_node~0.base |sll_insert_#in~head.base|) (= |sll_insert_#in~head.offset| sll_insert_~head.offset) (or (= (select (select |old(#memory_$Pointer$.offset)| |sll_insert_#in~head.base|) sll_insert_~head.offset) (select .cse16 sll_insert_~head.offset)) (not (= sll_insert_~head.offset 0)))))) (.cse8 (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| .cse14)))) (.cse9 (<= 0 sll_insert_~new_node~0.offset)) (.cse11 (exists ((node_create_~data Int)) (= (store |old(#memory_int)| sll_insert_~new_node~0.base (store (select |old(#memory_int)| sll_insert_~new_node~0.base) 0 node_create_~data)) |#memory_int|))) (.cse12 (= |#valid| (store |old(#valid)| .cse14 (select |#valid| .cse14))))) (or (and (= sll_insert_~snd_to_last~0.base 0) .cse0 .cse1 (= sll_insert_~snd_to_last~0.offset 0) (= sll_insert_~index |sll_insert_#in~index|) (= .cse2 sll_insert_~last~0.offset) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= .cse10 sll_insert_~last~0.base) .cse11 .cse12) (and .cse0 .cse1 (<= 2 |sll_insert_#in~index|) .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse11 .cse12) (and .cse0 (= sll_insert_~snd_to_last~0.base .cse10) (= .cse2 sll_insert_~snd_to_last~0.offset) .cse1 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse11 .cse12)))) [2018-10-26 19:57:25,836 INFO L425 ceAbstractionStarter]: For program point L592-4(lines 588 603) no Hoare annotation was computed. [2018-10-26 19:57:25,836 INFO L425 ceAbstractionStarter]: For program point sll_insertFINAL(lines 588 603) no Hoare annotation was computed. [2018-10-26 19:57:25,836 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:57:25,836 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 19:57:25,836 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 19:57:25,836 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:57:25,836 INFO L425 ceAbstractionStarter]: For program point L609(line 609) no Hoare annotation was computed. [2018-10-26 19:57:25,836 INFO L421 ceAbstractionStarter]: At program point L611-3(lines 611 618) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse1 (select |#memory_$Pointer$.base| .cse0)) (.cse11 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= 1 (select |#valid| .cse0)) (not (= .cse0 0)) (not (= 0 (select .cse1 4))) (<= main_~data~0 1) (= |main_~#s~0.offset| 0) (let ((.cse10 (+ .cse11 4))) (let ((.cse9 (select (select |#memory_$Pointer$.offset| .cse0) .cse10)) (.cse8 (select .cse1 .cse10))) (or (exists ((v_DerPreprocessor_4 Int)) (let ((.cse5 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse6 (select |#memory_$Pointer$.base| v_DerPreprocessor_4))) (let ((.cse3 (select .cse6 |main_~#s~0.offset|)) (.cse7 (+ .cse5 4))) (let ((.cse4 (select (select |#memory_$Pointer$.offset| .cse3) .cse7)) (.cse2 (select .cse6 .cse7))) (and (not (= .cse2 .cse3)) (not (= .cse2 0)) (<= 0 .cse4) (= .cse3 v_DerPreprocessor_4) (= 0 .cse4) (= .cse5 .cse4) (= .cse2 |main_~#s~0.base|)))))) (and (not (= .cse0 .cse8)) (= .cse9 0)) (and (<= 0 .cse9) (= 0 (select (select |#memory_$Pointer$.base| .cse8) 4)) (= 0 (select (select |#memory_$Pointer$.offset| .cse8) 4)))))) (= 0 .cse11) (<= main_~len~0 2) (<= 1 main_~data~0) (<= 2 main_~len~0)))) [2018-10-26 19:57:25,836 INFO L425 ceAbstractionStarter]: For program point L607(line 607) no Hoare annotation was computed. [2018-10-26 19:57:25,836 INFO L425 ceAbstractionStarter]: For program point L611-4(lines 604 626) no Hoare annotation was computed. [2018-10-26 19:57:25,837 INFO L421 ceAbstractionStarter]: At program point L607-1(line 607) the Hoare annotation is: (let ((.cse4 (@diff |old(#valid)| |#valid|))) (and (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |sll_insert_#in~head.base|) |sll_insert_#in~head.offset|))) (or (= 0 (select |old(#valid)| .cse0)) (let ((.cse1 (= 0 (select |old(#valid)| |sll_insert_#in~head.base|))) (.cse2 (select |old(#memory_$Pointer$.offset)| |sll_insert_#in~head.base|))) (and (or .cse1 (= (select |#memory_$Pointer$.offset| |sll_insert_#in~head.base|) .cse2)) (or .cse1 (let ((.cse3 (@diff |old(#memory_int)| |#memory_int|))) (and (= (store |old(#memory_int)| .cse3 (select |#memory_int| .cse3)) |#memory_int|) (or (= |#memory_int| |old(#memory_int)|) (not (= .cse3 .cse0))))) (not (= (select .cse2 |sll_insert_#in~head.offset|) 0))))) (= .cse0 |sll_insert_#in~head.base|))) (<= main_~data~0 1) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| .cse4))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= 0 |main_~#s~0.offset|) (<= main_~len~0 2) (<= 1 main_~data~0) (<= 2 main_~len~0) (= (select |#valid| |main_~#s~0.base|) 1) (= |#valid| (store |old(#valid)| .cse4 (select |#valid| .cse4))))) [2018-10-26 19:57:25,837 INFO L425 ceAbstractionStarter]: For program point L607-2(line 607) no Hoare annotation was computed. [2018-10-26 19:57:25,837 INFO L425 ceAbstractionStarter]: For program point L607-3(line 607) no Hoare annotation was computed. [2018-10-26 19:57:25,837 INFO L425 ceAbstractionStarter]: For program point L607-4(line 607) no Hoare annotation was computed. [2018-10-26 19:57:25,837 INFO L425 ceAbstractionStarter]: For program point L607-5(line 607) no Hoare annotation was computed. [2018-10-26 19:57:25,837 INFO L425 ceAbstractionStarter]: For program point L607-6(line 607) no Hoare annotation was computed. [2018-10-26 19:57:25,837 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 604 626) no Hoare annotation was computed. [2018-10-26 19:57:25,837 INFO L425 ceAbstractionStarter]: For program point L607-7(line 607) no Hoare annotation was computed. [2018-10-26 19:57:25,837 INFO L425 ceAbstractionStarter]: For program point L622(line 622) no Hoare annotation was computed. [2018-10-26 19:57:25,837 INFO L428 ceAbstractionStarter]: At program point L622-1(line 622) the Hoare annotation is: true [2018-10-26 19:57:25,837 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 604 626) no Hoare annotation was computed. [2018-10-26 19:57:25,837 INFO L421 ceAbstractionStarter]: At program point L620(lines 604 626) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (let ((.cse1 (select |#memory_$Pointer$.base| .cse0)) (.cse11 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= 1 (select |#valid| .cse0)) (not (= .cse0 0)) (not (= 0 (select .cse1 4))) (<= main_~data~0 1) (let ((.cse10 (+ .cse11 4))) (let ((.cse9 (select (select |#memory_$Pointer$.offset| .cse0) .cse10)) (.cse8 (select .cse1 .cse10))) (or (exists ((v_DerPreprocessor_4 Int)) (let ((.cse5 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse6 (select |#memory_$Pointer$.base| v_DerPreprocessor_4))) (let ((.cse3 (select .cse6 |main_~#s~0.offset|)) (.cse7 (+ .cse5 4))) (let ((.cse4 (select (select |#memory_$Pointer$.offset| .cse3) .cse7)) (.cse2 (select .cse6 .cse7))) (and (not (= .cse2 .cse3)) (not (= .cse2 0)) (<= 0 .cse4) (= .cse3 v_DerPreprocessor_4) (= 0 .cse4) (= .cse5 .cse4) (= .cse2 |main_~#s~0.base|)))))) (and (not (= .cse0 .cse8)) (= .cse9 0)) (and (<= 0 .cse9) (= 0 (select (select |#memory_$Pointer$.base| .cse8) 4)) (= 0 (select (select |#memory_$Pointer$.offset| .cse8) 4)))))) (= 0 .cse11) (= 0 |main_~#s~0.offset|) (<= main_~len~0 2) (<= 1 main_~data~0) (<= 2 main_~len~0)))) [2018-10-26 19:57:25,838 INFO L425 ceAbstractionStarter]: For program point L622-2(line 622) no Hoare annotation was computed. [2018-10-26 19:57:25,838 INFO L425 ceAbstractionStarter]: For program point L612(line 612) no Hoare annotation was computed. [2018-10-26 19:57:25,842 INFO L425 ceAbstractionStarter]: For program point L612-1(line 612) no Hoare annotation was computed. [2018-10-26 19:57:25,842 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2018-10-26 19:57:25,842 INFO L421 ceAbstractionStarter]: At program point L608(line 608) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (<= main_~data~0 1) (not (= 0 .cse0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (= 0 |main_~#s~0.offset|) (= main_~data~0 (select (select |#memory_int| .cse0) 0)) (<= main_~len~0 2) (= (select |#valid| .cse0) 1) (<= 1 main_~data~0) (<= 2 main_~len~0))) [2018-10-26 19:57:25,842 INFO L425 ceAbstractionStarter]: For program point L608-1(line 608) no Hoare annotation was computed. [2018-10-26 19:57:25,842 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 604 626) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-10-26 19:57:25,842 INFO L425 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2018-10-26 19:57:25,842 INFO L425 ceAbstractionStarter]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2018-10-26 19:57:25,843 INFO L425 ceAbstractionStarter]: For program point L611-1(lines 611 618) no Hoare annotation was computed. [2018-10-26 19:57:25,843 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-10-26 19:57:25,843 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-26 19:57:25,843 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-26 19:57:25,843 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-10-26 19:57:25,843 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-10-26 19:57:25,843 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-10-26 19:57:25,843 INFO L425 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-10-26 19:57:25,843 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-10-26 19:57:25,843 INFO L425 ceAbstractionStarter]: For program point L564-1(line 564) no Hoare annotation was computed. [2018-10-26 19:57:25,843 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-10-26 19:57:25,852 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,853 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,853 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,854 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,870 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,870 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,871 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,871 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,871 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,871 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,871 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,872 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,872 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,872 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,872 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,872 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,873 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,873 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,873 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,873 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,873 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,873 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,878 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,878 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,879 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,879 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,879 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,879 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,879 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,879 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,880 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,880 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,880 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,880 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,880 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,881 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,881 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,881 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,881 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,881 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,882 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,885 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,885 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,885 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,885 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,885 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,886 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,886 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,886 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,886 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,888 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,888 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,888 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,889 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,889 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,889 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,889 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,889 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,890 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,902 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,903 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,903 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,903 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,903 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,903 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,903 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,904 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,904 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,904 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,904 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,904 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,904 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,905 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,905 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,905 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,905 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,905 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,905 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,906 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,906 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,906 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,906 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,907 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,907 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,907 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,907 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,907 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,907 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,908 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,908 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,908 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,923 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,923 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,924 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,924 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,924 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,924 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,924 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,925 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,925 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,925 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,925 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,925 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,926 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,926 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,926 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,926 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,926 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,927 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,927 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,927 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,927 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,927 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,928 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,928 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,928 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,928 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,928 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,929 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,929 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,929 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,929 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,929 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,929 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,930 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,930 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,930 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,930 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,930 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,930 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,931 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,931 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,931 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,931 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,931 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,931 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,932 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,932 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,932 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,932 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,932 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,932 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,933 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,935 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,935 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,935 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,935 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,935 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,935 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,936 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,937 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,938 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,939 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,939 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,939 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,942 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,951 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,952 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,952 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,952 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:25,952 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:25,953 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,953 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,953 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,953 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,953 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:25,953 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:25,954 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,954 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,954 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,954 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,955 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:25,955 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:25,955 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,955 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,955 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,955 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:25,955 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:25,956 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:25,957 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:551) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:246) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translateSelect(Term2Expression.java:326) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:108) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:537) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-26 19:57:25,984 INFO L168 Benchmark]: Toolchain (without parser) took 76406.48 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 589.8 MB). Free memory was 958.0 MB in the beginning and 933.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 614.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:25,985 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:57:25,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.02 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 931.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:25,985 INFO L168 Benchmark]: Boogie Preprocessor took 123.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 931.2 MB in the beginning and 1.2 GB in the end (delta: -240.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:25,985 INFO L168 Benchmark]: RCFGBuilder took 727.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:25,985 INFO L168 Benchmark]: TraceAbstraction took 75157.02 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 405.3 MB). Free memory was 1.1 GB in the beginning and 933.8 MB in the end (delta: 186.3 MB). Peak memory consumption was 591.5 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:25,987 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 395.02 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 931.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 123.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 931.2 MB in the beginning and 1.2 GB in the end (delta: -240.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 727.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 75157.02 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 405.3 MB). Free memory was 1.1 GB in the beginning and 933.8 MB in the end (delta: 186.3 MB). Peak memory consumption was 591.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,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_DerPreprocessor_4,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,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$.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 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,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_DerPreprocessor_4,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,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$.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 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 624]: 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: 611]: Loop Invariant [2018-10-26 19:57:25,996 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,996 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,997 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,997 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,997 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:25,997 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:25,997 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:25,997 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,010 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,010 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,010 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,010 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,011 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,011 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,011 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,011 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,011 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,011 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,011 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,012 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,012 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,012 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,012 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,012 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,012 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,012 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,013 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,013 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,013 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,013 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,013 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,013 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,013 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,014 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,014 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,014 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,014 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,014 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,014 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,014 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,015 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,015 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,015 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,015 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,015 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,015 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,015 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,016 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,016 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,016 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,016 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,016 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,016 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,017 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,017 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,017 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,017 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,017 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,017 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,018 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,018 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,018 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,018 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,018 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,018 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,018 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,019 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,019 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,019 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,019 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,019 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,019 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,019 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,020 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,020 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,020 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,020 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,020 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,020 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,020 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,020 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,021 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,021 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,021 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,021 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,021 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,021 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,021 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,021 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,022 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,022 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,022 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,023 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,023 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,023 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,023 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,023 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,023 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,024 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,024 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,024 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,024 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,024 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,024 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,025 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,025 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,025 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,025 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,025 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,025 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,025 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,026 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,026 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,026 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,026 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,026 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,026 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,026 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,027 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,027 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,027 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2018-10-26 19:57:26,027 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,027 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,027 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,027 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,028 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,028 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,028 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,028 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,028 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,028 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,028 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,029 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,029 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,029 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,029 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,029 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,029 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,029 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,029 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,030 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,030 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,030 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,030 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,030 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,030 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,030 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,031 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,032 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,033 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,033 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,033 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,033 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,033 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,033 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,033 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,034 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,034 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,034 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,034 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,034 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,034 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,034 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,035 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,035 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,035 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,035 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,035 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,035 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,035 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((1 == \valid[#memory_$Pointer$[s][s]] && !(#memory_$Pointer$[s][s] == 0)) && !(0 == #memory_$Pointer$[#memory_$Pointer$[s][s]][4])) && data <= 1) && s == 0) && (((\exists v_DerPreprocessor_4 : int :: (((((!(#memory_$Pointer$[v_DerPreprocessor_4][#memory_$Pointer$[s][s] + 4] == #memory_$Pointer$[v_DerPreprocessor_4][s]) && !(#memory_$Pointer$[v_DerPreprocessor_4][#memory_$Pointer$[s][s] + 4] == 0)) && 0 <= #memory_$Pointer$[#memory_$Pointer$[v_DerPreprocessor_4][s]][#memory_$Pointer$[s][s] + 4]) && #memory_$Pointer$[v_DerPreprocessor_4][s] == v_DerPreprocessor_4) && 0 == #memory_$Pointer$[#memory_$Pointer$[v_DerPreprocessor_4][s]][#memory_$Pointer$[s][s] + 4]) && #memory_$Pointer$[s][s] == #memory_$Pointer$[#memory_$Pointer$[v_DerPreprocessor_4][s]][#memory_$Pointer$[s][s] + 4]) && #memory_$Pointer$[v_DerPreprocessor_4][#memory_$Pointer$[s][s] + 4] == s) || (!(#memory_$Pointer$[s][s] == #memory_$Pointer$[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4]) && #memory_$Pointer$[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] == 0)) || ((0 <= #memory_$Pointer$[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] && 0 == #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4]][4]) && 0 == #memory_$Pointer$[#memory_$Pointer$[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4]][4]))) && 0 == #memory_$Pointer$[s][s]) && len <= 2) && 1 <= data) && 2 <= len - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 574]: Loop Invariant [2018-10-26 19:57:26,036 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,053 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,053 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,054 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:26,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:26,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:26,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:26,055 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,055 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:57:26,055 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,055 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:57:26,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:26,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:26,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:57:26,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-26 19:57:26,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((data <= \old(data) && \valid == \old(\valid)) && \old(len) <= len) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(data) <= data) && #memory_$Pointer$ == \old(#memory_$Pointer$)) || ((((((((unknown-#memory_int-unknown[new_head][0] == \old(data) && 1 == \valid[head]) && \old(data) == data) && \old(data) == unknown-#memory_int-unknown[head][0]) && 1 == \valid[new_head]) && 0 == new_head) && !(0 == head)) && !(0 == new_head)) && 0 == head) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:551) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:57:28,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:57:28,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:57:28,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:57:28,128 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:57:28,129 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:57:28,130 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:57:28,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:57:28,134 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:57:28,135 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:57:28,136 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:57:28,136 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:57:28,137 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:57:28,138 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:57:28,139 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:57:28,140 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:57:28,141 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:57:28,143 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:57:28,145 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:57:28,146 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:57:28,147 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:57:28,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:57:28,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:57:28,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:57:28,152 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:57:28,153 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:57:28,154 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:57:28,154 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:57:28,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:57:28,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:57:28,156 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:57:28,157 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:57:28,157 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:57:28,157 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:57:28,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:57:28,160 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:57:28,160 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-10-26 19:57:28,183 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:57:28,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:57:28,188 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:57:28,188 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:57:28,189 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:57:28,189 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:57:28,189 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:57:28,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:57:28,189 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:57:28,189 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:57:28,190 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:57:28,190 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:57:28,190 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:57:28,190 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:57:28,190 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 19:57:28,190 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 19:57:28,191 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:57:28,191 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:57:28,191 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:57:28,191 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:57:28,191 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:57:28,191 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:57:28,192 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:57:28,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:57:28,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:57:28,192 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:57:28,192 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:57:28,192 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-10-26 19:57:28,193 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:57:28,193 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 19:57:28,193 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 19:57:28,193 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_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f7cafa734d0f20d504408b2e981cc49af978383 [2018-10-26 19:57:28,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:57:28,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:57:28,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:57:28,259 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:57:28,259 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:57:28,260 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/../../sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:57:28,308 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/data/9d17ecbff/36116eb6b6d147e49acaa8e2a9ba3c37/FLAG2bdb44093 [2018-10-26 19:57:28,787 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:57:28,788 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/sv-benchmarks/c/list-simple/sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:57:28,798 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/data/9d17ecbff/36116eb6b6d147e49acaa8e2a9ba3c37/FLAG2bdb44093 [2018-10-26 19:57:28,809 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/data/9d17ecbff/36116eb6b6d147e49acaa8e2a9ba3c37 [2018-10-26 19:57:28,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:57:28,815 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:57:28,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:57:28,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:57:28,819 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:57:28,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:57:28" (1/1) ... [2018-10-26 19:57:28,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53309be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:57:28, skipping insertion in model container [2018-10-26 19:57:28,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:57:28" (1/1) ... [2018-10-26 19:57:28,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:57:28,873 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:57:29,106 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:57:29,116 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:57:29,156 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:57:29,204 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:57:29,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:57:29 WrapperNode [2018-10-26 19:57:29,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:57:29,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:57:29,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:57:29,206 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:57:29,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:57:29" (1/1) ... [2018-10-26 19:57:29,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:57:29" (1/1) ... [2018-10-26 19:57:29,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:57:29" (1/1) ... [2018-10-26 19:57:29,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:57:29" (1/1) ... [2018-10-26 19:57:29,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:57:29" (1/1) ... [2018-10-26 19:57:29,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:57:29" (1/1) ... [2018-10-26 19:57:29,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:57:29" (1/1) ... [2018-10-26 19:57:29,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:57:29,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:57:29,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:57:29,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:57:29,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:57:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:57:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:57:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:57:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-10-26 19:57:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-10-26 19:57:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-10-26 19:57:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-10-26 19:57:29,377 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-10-26 19:57:29,377 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-10-26 19:57:29,377 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-10-26 19:57:29,377 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:57:29,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 19:57:29,377 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-10-26 19:57:29,377 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-10-26 19:57:29,377 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-26 19:57:29,378 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-26 19:57:29,379 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-26 19:57:29,379 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-26 19:57:29,379 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-26 19:57:29,379 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-26 19:57:29,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-26 19:57:29,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-26 19:57:29,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-26 19:57:29,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-26 19:57:29,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-26 19:57:29,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-26 19:57:29,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-26 19:57:29,380 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-26 19:57:29,380 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-26 19:57:29,381 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-26 19:57:29,381 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-26 19:57:29,381 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-26 19:57:29,381 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-26 19:57:29,381 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-26 19:57:29,381 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-26 19:57:29,381 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-26 19:57:29,381 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-26 19:57:29,381 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-26 19:57:29,382 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-26 19:57:29,382 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-26 19:57:29,382 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-26 19:57:29,382 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-26 19:57:29,382 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-26 19:57:29,382 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-26 19:57:29,382 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-26 19:57:29,382 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-26 19:57:29,382 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-26 19:57:29,383 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-26 19:57:29,383 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-26 19:57:29,383 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-26 19:57:29,383 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-26 19:57:29,383 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-26 19:57:29,383 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-26 19:57:29,383 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-26 19:57:29,383 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-26 19:57:29,384 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-26 19:57:29,384 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-26 19:57:29,384 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-26 19:57:29,384 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-26 19:57:29,384 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-26 19:57:29,384 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-26 19:57:29,384 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-26 19:57:29,384 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-26 19:57:29,384 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-26 19:57:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-26 19:57:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-26 19:57:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-26 19:57:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-26 19:57:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-26 19:57:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-26 19:57:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-26 19:57:29,385 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-26 19:57:29,386 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-10-26 19:57:29,390 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-26 19:57:29,391 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-26 19:57:29,391 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-10-26 19:57:29,391 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-26 19:57:29,391 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:57:29,391 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-10-26 19:57:29,391 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-26 19:57:29,391 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-26 19:57:29,392 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-26 19:57:29,392 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-26 19:57:29,392 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-26 19:57:29,392 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-26 19:57:29,392 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-26 19:57:29,392 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-26 19:57:29,392 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-26 19:57:29,392 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-26 19:57:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-26 19:57:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-26 19:57:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-26 19:57:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-26 19:57:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-26 19:57:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-26 19:57:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-26 19:57:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-26 19:57:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-26 19:57:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-26 19:57:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-26 19:57:29,396 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-26 19:57:29,396 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-26 19:57:29,396 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-26 19:57:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-26 19:57:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-26 19:57:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-26 19:57:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-26 19:57:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-26 19:57:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-26 19:57:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-26 19:57:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-26 19:57:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-26 19:57:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-26 19:57:29,398 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-26 19:57:29,398 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-26 19:57:29,398 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-26 19:57:29,398 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-26 19:57:29,398 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-10-26 19:57:29,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-26 19:57:29,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-26 19:57:29,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-10-26 19:57:29,398 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-10-26 19:57:29,398 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-10-26 19:57:29,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-26 19:57:29,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-26 19:57:29,399 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-10-26 19:57:29,399 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:57:29,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-10-26 19:57:29,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:57:29,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:57:29,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-10-26 19:57:30,050 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:57:30,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:57:30 BoogieIcfgContainer [2018-10-26 19:57:30,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:57:30,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:57:30,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:57:30,054 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:57:30,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:57:28" (1/3) ... [2018-10-26 19:57:30,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478262f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:57:30, skipping insertion in model container [2018-10-26 19:57:30,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:57:29" (2/3) ... [2018-10-26 19:57:30,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478262f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:57:30, skipping insertion in model container [2018-10-26 19:57:30,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:57:30" (3/3) ... [2018-10-26 19:57:30,056 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal_true-unreach-call_true-valid-memsafety.i [2018-10-26 19:57:30,064 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:57:30,070 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:57:30,083 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:57:30,106 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:57:30,107 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:57:30,107 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:57:30,107 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:57:30,107 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:57:30,108 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:57:30,108 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:57:30,108 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:57:30,108 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:57:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-10-26 19:57:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 19:57:30,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:57:30,128 INFO L375 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, 1] [2018-10-26 19:57:30,130 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:57:30,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:57:30,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1638660761, now seen corresponding path program 1 times [2018-10-26 19:57:30,139 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:57:30,140 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:57:30,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:57:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:30,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:57:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:30,262 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 19:57:30,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:57:30,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:57:30,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 19:57:30,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 19:57:30,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:57:30,285 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-10-26 19:57:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:57:30,308 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2018-10-26 19:57:30,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 19:57:30,309 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 41 [2018-10-26 19:57:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:57:30,317 INFO L225 Difference]: With dead ends: 142 [2018-10-26 19:57:30,317 INFO L226 Difference]: Without dead ends: 57 [2018-10-26 19:57:30,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:57:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-26 19:57:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-26 19:57:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-26 19:57:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-10-26 19:57:30,359 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 41 [2018-10-26 19:57:30,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:57:30,360 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-10-26 19:57:30,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 19:57:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-10-26 19:57:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 19:57:30,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:57:30,363 INFO L375 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, 1, 1, 1, 1] [2018-10-26 19:57:30,363 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:57:30,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:57:30,363 INFO L82 PathProgramCache]: Analyzing trace with hash 227048233, now seen corresponding path program 1 times [2018-10-26 19:57:30,364 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:57:30,364 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:57:30,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:57:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:30,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:57:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:30,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 19:57:30,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:57:30,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:57:30,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:57:30,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:57:30,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:57:30,564 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 3 states. [2018-10-26 19:57:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:57:30,648 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-10-26 19:57:30,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:57:30,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-26 19:57:30,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:57:30,652 INFO L225 Difference]: With dead ends: 78 [2018-10-26 19:57:30,652 INFO L226 Difference]: Without dead ends: 63 [2018-10-26 19:57:30,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:57:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-26 19:57:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-10-26 19:57:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-26 19:57:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-10-26 19:57:30,662 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 44 [2018-10-26 19:57:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:57:30,664 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-10-26 19:57:30,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:57:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-10-26 19:57:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 19:57:30,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:57:30,665 INFO L375 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, 1, 1, 1, 1] [2018-10-26 19:57:30,666 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:57:30,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:57:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1458379063, now seen corresponding path program 1 times [2018-10-26 19:57:30,667 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:57:30,667 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:57:30,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:57:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:30,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:57:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:30,872 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 19:57:30,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:57:30,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:57:30,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:57:30,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:57:30,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:57:30,883 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 5 states. [2018-10-26 19:57:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:57:31,004 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-10-26 19:57:31,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:57:31,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-26 19:57:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:57:31,006 INFO L225 Difference]: With dead ends: 111 [2018-10-26 19:57:31,006 INFO L226 Difference]: Without dead ends: 67 [2018-10-26 19:57:31,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:57:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-26 19:57:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-10-26 19:57:31,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-26 19:57:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-10-26 19:57:31,015 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 44 [2018-10-26 19:57:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:57:31,016 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-10-26 19:57:31,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:57:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-10-26 19:57:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-26 19:57:31,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:57:31,018 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:57:31,018 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:57:31,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:57:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash 60923689, now seen corresponding path program 1 times [2018-10-26 19:57:31,019 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:57:31,019 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:57:31,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:57:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:31,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:57:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:57:31,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:57:31,495 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 19:57:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 19:57:31,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:57:31,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-10-26 19:57:31,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 19:57:31,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 19:57:31,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-10-26 19:57:31,890 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 9 states. [2018-10-26 19:57:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:57:32,144 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2018-10-26 19:57:32,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 19:57:32,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-10-26 19:57:32,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:57:32,145 INFO L225 Difference]: With dead ends: 118 [2018-10-26 19:57:32,145 INFO L226 Difference]: Without dead ends: 74 [2018-10-26 19:57:32,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-26 19:57:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-26 19:57:32,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-10-26 19:57:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-26 19:57:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-10-26 19:57:32,152 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 60 [2018-10-26 19:57:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:57:32,153 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-10-26 19:57:32,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 19:57:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-10-26 19:57:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-26 19:57:32,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:57:32,154 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:57:32,154 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:57:32,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:57:32,155 INFO L82 PathProgramCache]: Analyzing trace with hash -646735991, now seen corresponding path program 2 times [2018-10-26 19:57:32,155 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:57:32,155 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:57:32,170 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 19:57:32,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-26 19:57:32,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:57:32,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:57:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 19:57:32,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 19:57:32,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:57:32,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:57:32,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:57:32,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:57:32,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:57:32,379 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 5 states. [2018-10-26 19:57:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:57:32,479 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-10-26 19:57:32,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:57:32,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-10-26 19:57:32,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:57:32,480 INFO L225 Difference]: With dead ends: 86 [2018-10-26 19:57:32,480 INFO L226 Difference]: Without dead ends: 70 [2018-10-26 19:57:32,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:57:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-26 19:57:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-10-26 19:57:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-26 19:57:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-10-26 19:57:32,489 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 76 [2018-10-26 19:57:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:57:32,490 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-10-26 19:57:32,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:57:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-10-26 19:57:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 19:57:32,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:57:32,491 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:57:32,491 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:57:32,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:57:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1945968610, now seen corresponding path program 1 times [2018-10-26 19:57:32,492 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 19:57:32,492 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 19:57:32,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 19:57:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:32,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:57:32,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 19:57:32,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:32,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:32,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 19:57:32,978 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-10-26 19:57:33,435 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:33,436 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:33,437 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:33,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-10-26 19:57:33,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2018-10-26 19:57:33,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:33,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:33,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:57:33,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-10-26 19:57:33,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-10-26 19:57:33,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:57:33,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:33,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:33,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:57:33,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:52 [2018-10-26 19:57:34,755 WARN L854 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~snd_to_last~0.offset (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32)) (sll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd sll_insert_~snd_to_last~0.offset (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (bvadd sll_insert_~new_node~0.offset (_ bv4 32)) sll_insert_~last~0.base))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))) is different from true [2018-10-26 19:57:35,170 WARN L179 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-10-26 19:57:35,207 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:35,219 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:35,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:35,229 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:35,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-10-26 19:57:35,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:35,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 122 treesize of output 96 [2018-10-26 19:57:35,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 19:57:35,414 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:35,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 76 [2018-10-26 19:57:35,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 19:57:35,506 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:35,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 70 [2018-10-26 19:57:35,644 INFO L477 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 18 treesize of output 27 [2018-10-26 19:57:35,644 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-26 19:57:35,737 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:35,803 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:35,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:35,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-26 19:57:35,951 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:186, output treesize:124 [2018-10-26 19:57:36,088 INFO L477 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 56 treesize of output 36 [2018-10-26 19:57:36,094 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-10-26 19:57:36,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:36,108 INFO L477 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 17 treesize of output 9 [2018-10-26 19:57:36,108 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:36,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:36,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:36,119 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:56, output treesize:4 [2018-10-26 19:57:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 23 not checked. [2018-10-26 19:57:36,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:57:36,553 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-26 19:57:36,791 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-26 19:57:36,912 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-26 19:57:38,939 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_node_create_~temp~0.offset_24 (_ BitVec 32)) (v_sll_insert_~snd_to_last~0.offset_12 (_ BitVec 32)) (v_sll_insert_~new_node~0.offset_10 (_ BitVec 32)) (v_sll_insert_~new_node~0.base_10 (_ BitVec 32)) (v_sll_insert_~last~0.base_12 (_ BitVec 32))) (or (not (= (select |c_#valid| v_sll_insert_~new_node~0.base_10) (_ bv0 1))) (not (= (_ bv0 32) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| v_sll_insert_~new_node~0.base_10 (store (select |c_#memory_$Pointer$.base| v_sll_insert_~new_node~0.base_10) (bvadd v_node_create_~temp~0.offset_24 (_ bv4 32)) (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_main_~#s~0.base|) |c_main_~#s~0.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd v_sll_insert_~snd_to_last~0.offset_12 (_ bv4 32)) v_sll_insert_~new_node~0.base_10)))))) (store .cse0 v_sll_insert_~new_node~0.base_10 (store (select .cse0 v_sll_insert_~new_node~0.base_10) (bvadd v_sll_insert_~new_node~0.offset_10 (_ bv4 32)) v_sll_insert_~last~0.base_12))) |c_main_~#s~0.base|) |c_main_~#s~0.offset|))))) is different from false [2018-10-26 19:57:38,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:57:38,948 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:57:38,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:57:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:39,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:57:39,149 INFO L477 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 6 treesize of output 5 [2018-10-26 19:57:39,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:39,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:39,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-10-26 19:57:39,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:57:39,730 INFO L477 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-10-26 19:57:39,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:39,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:39,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 19:57:39,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 19:57:39,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:39,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:39,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:39,790 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:28 [2018-10-26 19:57:42,565 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (_ bv4 32) sll_insert_~last~0.base)))) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))) is different from true [2018-10-26 19:57:42,927 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2018-10-26 19:57:42,960 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:42,966 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:42,966 INFO L477 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 17 treesize of output 8 [2018-10-26 19:57:42,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:43,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 85 [2018-10-26 19:57:43,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 83 [2018-10-26 19:57:43,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:43,772 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:43,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 86 [2018-10-26 19:57:43,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:44,374 INFO L477 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 59 [2018-10-26 19:57:44,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-26 19:57:44,379 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:44,401 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:44,411 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2018-10-26 19:57:44,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 41 treesize of output 48 [2018-10-26 19:57:44,418 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:44,432 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:44,444 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:44,744 INFO L477 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 67 [2018-10-26 19:57:44,749 INFO L477 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 61 treesize of output 60 [2018-10-26 19:57:44,750 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:45,008 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:45,010 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:45,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 65 [2018-10-26 19:57:45,011 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:45,233 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:45,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 67 [2018-10-26 19:57:45,277 INFO L477 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 59 treesize of output 53 [2018-10-26 19:57:45,277 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:45,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 44 treesize of output 51 [2018-10-26 19:57:45,353 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:45,405 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:57:45,593 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:45,685 INFO L477 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 62 [2018-10-26 19:57:45,715 INFO L477 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 54 treesize of output 48 [2018-10-26 19:57:45,716 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:45,818 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:57:45,818 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:57:45,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 73 [2018-10-26 19:57:45,829 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:57:45,849 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:57:45,926 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-10-26 19:57:46,045 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 19:57:46,140 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 19:57:46,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2018-10-26 19:57:46,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-10-26 19:57:46,187 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,212 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-10-26 19:57:46,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-26 19:57:46,220 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,231 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 19:57:46,270 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 5 variables, input treesize:170, output treesize:67 [2018-10-26 19:57:46,501 INFO L477 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 1 case distinctions, treesize of input 32 treesize of output 28 [2018-10-26 19:57:46,507 INFO L477 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 24 treesize of output 15 [2018-10-26 19:57:46,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-10-26 19:57:46,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,730 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2018-10-26 19:57:46,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,756 INFO L477 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2018-10-26 19:57:46,770 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-10-26 19:57:46,770 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-10-26 19:57:46,783 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-10-26 19:57:46,794 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,796 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:57:46,799 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:72, output treesize:1 [2018-10-26 19:57:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 19:57:46,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:57:47,470 WARN L179 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-10-26 19:57:47,571 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-26 19:57:47,842 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-10-26 19:57:47,977 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-26 19:57:50,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:57:50,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 55 [2018-10-26 19:57:50,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-26 19:57:50,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-26 19:57:50,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2629, Unknown=107, NotChecked=428, Total=3306 [2018-10-26 19:57:50,443 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 55 states. [2018-10-26 19:57:52,367 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2018-10-26 19:58:04,508 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32))) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))))) (let ((.cse2 (select (select .cse1 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (select (select (store |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))) |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|) (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse0 sll_insert_~new_node~0.base (store (select .cse0 sll_insert_~new_node~0.base) (_ bv4 32) sll_insert_~last~0.base)))) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base)))) (exists ((node_create_~temp~0.offset (_ BitVec 32)) (sll_insert_~new_node~0.base (_ BitVec 32)) (sll_insert_~snd_to_last~0.offset (_ BitVec 32)) (sll_insert_~last~0.base (_ BitVec 32)) (sll_insert_~new_node~0.offset (_ BitVec 32))) (and (= (let ((.cse3 (let ((.cse4 (store |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |c_old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))))) (let ((.cse5 (select (select .cse4 |c_sll_insert_#in~head.base|) |c_sll_insert_#in~head.offset|))) (store .cse4 .cse5 (store (select .cse4 .cse5) (bvadd sll_insert_~snd_to_last~0.offset (_ bv4 32)) sll_insert_~new_node~0.base)))))) (store .cse3 sll_insert_~new_node~0.base (store (select .cse3 sll_insert_~new_node~0.base) (bvadd sll_insert_~new_node~0.offset (_ bv4 32)) sll_insert_~last~0.base))) |c_#memory_$Pointer$.base|) (= (_ bv0 1) (select |c_old(#valid)| sll_insert_~new_node~0.base))))) is different from true [2018-10-26 19:58:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:58:06,503 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2018-10-26 19:58:06,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-26 19:58:06,508 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 80 [2018-10-26 19:58:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:58:06,509 INFO L225 Difference]: With dead ends: 121 [2018-10-26 19:58:06,509 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 19:58:06,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=351, Invalid=6152, Unknown=159, NotChecked=820, Total=7482 [2018-10-26 19:58:06,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 19:58:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 19:58:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 19:58:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 19:58:06,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-10-26 19:58:06,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:58:06,514 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 19:58:06,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-26 19:58:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 19:58:06,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 19:58:06,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 19:58:06,965 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2018-10-26 19:58:07,025 INFO L425 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-10-26 19:58:07,025 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-10-26 19:58:07,025 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-10-26 19:58:07,025 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-10-26 19:58:07,026 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:58:07,026 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-10-26 19:58:07,026 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:58:07,026 INFO L425 ceAbstractionStarter]: For program point L584(line 584) no Hoare annotation was computed. [2018-10-26 19:58:07,026 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-26 19:58:07,026 INFO L425 ceAbstractionStarter]: For program point L584-1(line 584) no Hoare annotation was computed. [2018-10-26 19:58:07,026 INFO L425 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2018-10-26 19:58:07,026 INFO L425 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-10-26 19:58:07,026 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 586) no Hoare annotation was computed. [2018-10-26 19:58:07,026 INFO L428 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-10-26 19:58:07,026 INFO L428 ceAbstractionStarter]: At program point L582-3(lines 582 586) the Hoare annotation is: true [2018-10-26 19:58:07,026 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 581 587) no Hoare annotation was computed. [2018-10-26 19:58:07,026 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 63 67) no Hoare annotation was computed. [2018-10-26 19:58:07,026 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 63 67) no Hoare annotation was computed. [2018-10-26 19:58:07,027 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 63 67) no Hoare annotation was computed. [2018-10-26 19:58:07,027 INFO L425 ceAbstractionStarter]: For program point L576(line 576) no Hoare annotation was computed. [2018-10-26 19:58:07,027 INFO L421 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (let ((.cse0 (or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32))))) (or (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) .cse0) (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))) .cse0 (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) sll_create_~new_head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset)))) [2018-10-26 19:58:07,027 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-10-26 19:58:07,027 INFO L425 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-10-26 19:58:07,027 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-10-26 19:58:07,027 INFO L425 ceAbstractionStarter]: For program point L574-1(lines 574 578) no Hoare annotation was computed. [2018-10-26 19:58:07,027 INFO L425 ceAbstractionStarter]: For program point L574-3(lines 574 578) no Hoare annotation was computed. [2018-10-26 19:58:07,027 INFO L421 ceAbstractionStarter]: At program point L574-4(lines 574 578) the Hoare annotation is: (or (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 32) sll_create_~new_head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset)) (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) [2018-10-26 19:58:07,027 INFO L425 ceAbstractionStarter]: For program point L574-5(lines 574 578) no Hoare annotation was computed. [2018-10-26 19:58:07,027 INFO L421 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-26 19:58:07,027 INFO L425 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-10-26 19:58:07,027 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 68 72) no Hoare annotation was computed. [2018-10-26 19:58:07,028 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 68 72) no Hoare annotation was computed. [2018-10-26 19:58:07,028 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 68 72) no Hoare annotation was computed. [2018-10-26 19:58:07,028 INFO L421 ceAbstractionStarter]: At program point sll_insertENTRY(lines 588 603) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-26 19:58:07,028 INFO L425 ceAbstractionStarter]: For program point L591(line 591) no Hoare annotation was computed. [2018-10-26 19:58:07,028 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-26 19:58:07,028 INFO L421 ceAbstractionStarter]: At program point L589(line 589) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= sll_insert_~index |sll_insert_#in~index|) (= sll_insert_~head.offset |sll_insert_#in~head.offset|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-26 19:58:07,028 INFO L425 ceAbstractionStarter]: For program point sll_insertEXIT(lines 588 603) no Hoare annotation was computed. [2018-10-26 19:58:07,028 INFO L425 ceAbstractionStarter]: For program point L589-1(line 589) no Hoare annotation was computed. [2018-10-26 19:58:07,028 INFO L425 ceAbstractionStarter]: For program point L600(line 600) no Hoare annotation was computed. [2018-10-26 19:58:07,028 INFO L425 ceAbstractionStarter]: For program point L600-1(lines 597 601) no Hoare annotation was computed. [2018-10-26 19:58:07,028 INFO L425 ceAbstractionStarter]: For program point L598(line 598) no Hoare annotation was computed. [2018-10-26 19:58:07,028 INFO L425 ceAbstractionStarter]: For program point L594(line 594) no Hoare annotation was computed. [2018-10-26 19:58:07,028 INFO L425 ceAbstractionStarter]: For program point L594-1(line 594) no Hoare annotation was computed. [2018-10-26 19:58:07,028 INFO L425 ceAbstractionStarter]: For program point L592-1(lines 592 596) no Hoare annotation was computed. [2018-10-26 19:58:07,029 INFO L421 ceAbstractionStarter]: At program point L592-3(lines 592 596) the Hoare annotation is: (and (exists ((node_create_~temp~0.offset (_ BitVec 32))) (= (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (bvadd node_create_~temp~0.offset (_ bv4 32)) (_ bv0 32))) |#memory_$Pointer$.base|)) (= sll_insert_~new_node~0.offset (_ bv0 32)) (= sll_insert_~head.base |sll_insert_#in~head.base|) (= (store |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.offset)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (_ bv0 1) (select |old(#valid)| sll_insert_~new_node~0.base)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base (store (select |old(#memory_$Pointer$.base)| sll_insert_~new_node~0.base) (_ bv4 32) (_ bv0 32)))) (= sll_insert_~head.offset |sll_insert_#in~head.offset|)) [2018-10-26 19:58:07,029 INFO L425 ceAbstractionStarter]: For program point L592-4(lines 588 603) no Hoare annotation was computed. [2018-10-26 19:58:07,029 INFO L425 ceAbstractionStarter]: For program point sll_insertFINAL(lines 588 603) no Hoare annotation was computed. [2018-10-26 19:58:07,029 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:58:07,029 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 19:58:07,029 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 19:58:07,029 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:58:07,029 INFO L425 ceAbstractionStarter]: For program point L609(line 609) no Hoare annotation was computed. [2018-10-26 19:58:07,029 INFO L421 ceAbstractionStarter]: At program point L611-3(lines 611 618) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) [2018-10-26 19:58:07,029 INFO L425 ceAbstractionStarter]: For program point L607(line 607) no Hoare annotation was computed. [2018-10-26 19:58:07,029 INFO L425 ceAbstractionStarter]: For program point L611-4(lines 604 626) no Hoare annotation was computed. [2018-10-26 19:58:07,029 INFO L421 ceAbstractionStarter]: At program point L607-1(line 607) the Hoare annotation is: (and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) [2018-10-26 19:58:07,029 INFO L425 ceAbstractionStarter]: For program point L607-2(line 607) no Hoare annotation was computed. [2018-10-26 19:58:07,030 INFO L425 ceAbstractionStarter]: For program point L607-3(line 607) no Hoare annotation was computed. [2018-10-26 19:58:07,030 INFO L425 ceAbstractionStarter]: For program point L607-4(line 607) no Hoare annotation was computed. [2018-10-26 19:58:07,030 INFO L425 ceAbstractionStarter]: For program point L607-5(line 607) no Hoare annotation was computed. [2018-10-26 19:58:07,030 INFO L425 ceAbstractionStarter]: For program point L607-6(line 607) no Hoare annotation was computed. [2018-10-26 19:58:07,030 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 604 626) no Hoare annotation was computed. [2018-10-26 19:58:07,030 INFO L425 ceAbstractionStarter]: For program point L607-7(line 607) no Hoare annotation was computed. [2018-10-26 19:58:07,030 INFO L425 ceAbstractionStarter]: For program point L622(line 622) no Hoare annotation was computed. [2018-10-26 19:58:07,030 INFO L428 ceAbstractionStarter]: At program point L622-1(line 622) the Hoare annotation is: true [2018-10-26 19:58:07,030 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 604 626) no Hoare annotation was computed. [2018-10-26 19:58:07,030 INFO L421 ceAbstractionStarter]: At program point L620(lines 604 626) the Hoare annotation is: (and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) [2018-10-26 19:58:07,030 INFO L425 ceAbstractionStarter]: For program point L622-2(line 622) no Hoare annotation was computed. [2018-10-26 19:58:07,030 INFO L425 ceAbstractionStarter]: For program point L612(line 612) no Hoare annotation was computed. [2018-10-26 19:58:07,030 INFO L425 ceAbstractionStarter]: For program point L612-1(line 612) no Hoare annotation was computed. [2018-10-26 19:58:07,031 INFO L421 ceAbstractionStarter]: At program point L608(line 608) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (_ bv0 32) .cse0)) (= (_ bv1 1) (select |#valid| .cse0)))) [2018-10-26 19:58:07,031 INFO L425 ceAbstractionStarter]: For program point L608-1(line 608) no Hoare annotation was computed. [2018-10-26 19:58:07,031 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2018-10-26 19:58:07,031 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 604 626) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-26 19:58:07,031 INFO L425 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2018-10-26 19:58:07,031 INFO L425 ceAbstractionStarter]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2018-10-26 19:58:07,031 INFO L425 ceAbstractionStarter]: For program point L611-1(lines 611 618) no Hoare annotation was computed. [2018-10-26 19:58:07,031 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-10-26 19:58:07,031 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-26 19:58:07,031 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-26 19:58:07,031 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-10-26 19:58:07,032 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-10-26 19:58:07,032 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-10-26 19:58:07,032 INFO L425 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-10-26 19:58:07,032 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-10-26 19:58:07,032 INFO L425 ceAbstractionStarter]: For program point L564-1(line 564) no Hoare annotation was computed. [2018-10-26 19:58:07,032 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-10-26 19:58:07,043 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,044 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,044 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,045 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,045 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,045 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,045 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,045 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,046 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,046 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,046 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,046 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,047 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,047 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,047 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,047 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,048 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,049 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,049 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-10-26 19:58:07,049 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,049 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,050 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,053 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,053 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,053 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,053 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,055 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,056 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,056 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-10-26 19:58:07,056 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,056 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,056 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,057 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,057 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,057 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,057 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,057 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,057 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,058 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,062 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,062 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,062 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,062 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,062 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,062 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:58:07 BoogieIcfgContainer [2018-10-26 19:58:07,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:58:07,065 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:58:07,065 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:58:07,065 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:58:07,065 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:57:30" (3/4) ... [2018-10-26 19:58:07,070 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 19:58:07,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-10-26 19:58:07,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 19:58:07,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_destroy [2018-10-26 19:58:07,076 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-10-26 19:58:07,077 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-10-26 19:58:07,077 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_create [2018-10-26 19:58:07,077 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_insert [2018-10-26 19:58:07,077 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 19:58:07,077 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-10-26 19:58:07,082 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-10-26 19:58:07,082 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-26 19:58:07,082 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 19:58:07,107 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1bv1 == \valid[head] && new_head == 0bv32) && !(head == 0bv32)) && ~bvadd64(\valid[new_head], 1bv1) == 0bv1) && !(0bv32 == new_head)) && 0bv32 == head) || (((\valid == \old(\valid) && \old(len) == len) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) [2018-10-26 19:58:07,107 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\exists node_create_~temp~0.offset : bv32 :: \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][~bvadd64(node_create_~temp~0.offset, 4bv32) := 0bv32]] == #memory_$Pointer$) && new_node == 0bv32) && head == head) && \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][4bv32 := 0bv32]] == #memory_$Pointer$) && 0bv1 == \old(\valid)[new_node]) && #memory_$Pointer$ == \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][4bv32 := 0bv32]]) && head == head [2018-10-26 19:58:07,127 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2c6e81bc-ff92-426d-a12d-91c78f89e9c8/bin-2019/uautomizer/witness.graphml [2018-10-26 19:58:07,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:58:07,127 INFO L168 Benchmark]: Toolchain (without parser) took 38313.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 946.5 MB in the beginning and 892.9 MB in the end (delta: 53.7 MB). Peak memory consumption was 365.6 MB. Max. memory is 11.5 GB. [2018-10-26 19:58:07,128 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:58:07,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.44 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 919.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-10-26 19:58:07,128 INFO L168 Benchmark]: Boogie Preprocessor took 55.13 ms. Allocated memory is still 1.0 GB. Free memory was 919.7 MB in the beginning and 914.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:58:07,129 INFO L168 Benchmark]: RCFGBuilder took 789.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 914.3 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:58:07,129 INFO L168 Benchmark]: TraceAbstraction took 37013.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.1 MB). Free memory was 1.1 GB in the beginning and 901.5 MB in the end (delta: 190.6 MB). Peak memory consumption was 344.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:58:07,129 INFO L168 Benchmark]: Witness Printer took 62.32 ms. Allocated memory is still 1.3 GB. Free memory was 901.5 MB in the beginning and 892.9 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2018-10-26 19:58:07,133 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 389.44 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 919.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.13 ms. Allocated memory is still 1.0 GB. Free memory was 919.7 MB in the beginning and 914.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 789.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 914.3 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37013.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.1 MB). Free memory was 1.1 GB in the beginning and 901.5 MB in the end (delta: 190.6 MB). Peak memory consumption was 344.7 MB. Max. memory is 11.5 GB. * Witness Printer took 62.32 ms. Allocated memory is still 1.3 GB. Free memory was 901.5 MB in the beginning and 892.9 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 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$.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$.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[node_create_~temp~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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 624]: 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: 611]: Loop Invariant Derived loop invariant: s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32 - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 574]: Loop Invariant [2018-10-26 19:58:07,147 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,147 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,148 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,148 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,148 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,149 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,149 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,149 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,149 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,149 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((1bv1 == \valid[head] && new_head == 0bv32) && !(head == 0bv32)) && ~bvadd64(\valid[new_head], 1bv1) == 0bv1) && !(0bv32 == new_head)) && 0bv32 == head) || (((\valid == \old(\valid) && \old(len) == len) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(#memory_$Pointer$) == #memory_$Pointer$) - InvariantResult [Line: 592]: Loop Invariant [2018-10-26 19:58:07,150 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,150 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,150 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-10-26 19:58:07,150 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,150 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,150 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,151 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,151 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,151 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,151 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,151 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,152 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,153 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,153 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,153 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[node_create_~temp~0.offset,QUANTIFIED] [2018-10-26 19:58:07,160 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,160 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,161 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,161 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-10-26 19:58:07,161 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,161 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,161 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-10-26 19:58:07,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-10-26 19:58:07,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((\exists node_create_~temp~0.offset : bv32 :: \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][~bvadd64(node_create_~temp~0.offset, 4bv32) := 0bv32]] == #memory_$Pointer$) && new_node == 0bv32) && head == head) && \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][4bv32 := 0bv32]] == #memory_$Pointer$) && 0bv1 == \old(\valid)[new_node]) && #memory_$Pointer$ == \old(#memory_$Pointer$)[new_node := \old(#memory_$Pointer$)[new_node][4bv32 := 0bv32]]) && head == head - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: s == 0bv32 && ~bvadd64(len, 4294967294bv32) == 0bv32 - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 88 locations, 1 error locations. SAFE Result, 36.9s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 16.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 369 SDtfs, 254 SDslu, 1878 SDs, 0 SdLazy, 1704 SolverSat, 40 SolverUnsat, 136 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 530 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 49 PreInvPairs, 70 NumberOfFragments, 289 HoareAnnotationTreeSize, 49 FomulaSimplifications, 1107 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 153 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 425 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 477 ConstructedInterpolants, 48 QuantifiedInterpolants, 272432 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1119 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 93/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...