./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.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_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/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 63ea7ed840682b4e196bd141458679e7836ad115 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 21:48:22,187 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 21:48:22,188 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 21:48:22,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 21:48:22,195 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 21:48:22,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 21:48:22,196 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 21:48:22,197 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 21:48:22,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 21:48:22,199 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 21:48:22,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 21:48:22,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 21:48:22,201 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 21:48:22,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 21:48:22,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 21:48:22,202 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 21:48:22,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 21:48:22,203 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 21:48:22,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 21:48:22,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 21:48:22,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 21:48:22,206 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 21:48:22,208 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 21:48:22,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 21:48:22,208 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 21:48:22,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 21:48:22,209 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 21:48:22,210 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 21:48:22,210 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 21:48:22,211 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 21:48:22,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 21:48:22,212 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 21:48:22,212 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 21:48:22,212 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 21:48:22,213 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 21:48:22,213 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 21:48:22,213 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-09 21:48:22,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 21:48:22,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 21:48:22,221 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-09 21:48:22,221 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-09 21:48:22,222 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 21:48:22,222 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 21:48:22,222 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 21:48:22,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 21:48:22,225 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 21:48:22,226 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 21:48:22,226 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 21:48:22,226 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 21:48:22,226 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-09 21:48:22,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-09 21:48:22,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-09 21:48:22,226 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 21:48:22,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 21:48:22,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-09 21:48:22,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 21:48:22,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 21:48:22,227 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-09 21:48:22,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-09 21:48:22,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-09 21:48:22,227 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 21:48:22,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-09 21:48:22,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-09 21:48:22,228 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 21:48:22,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-09 21:48:22,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-09 21:48:22,228 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_557ef115-f084-4b7a-b640-ccc84e15eb0a/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 -> 63ea7ed840682b4e196bd141458679e7836ad115 [2018-11-09 21:48:22,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 21:48:22,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 21:48:22,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 21:48:22,260 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 21:48:22,261 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 21:48:22,261 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/../../sv-benchmarks/c/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i [2018-11-09 21:48:22,297 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/data/3ed8c5278/acf72801790b415eb8654273d7c1da91/FLAG5241e14d6 [2018-11-09 21:48:22,741 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 21:48:22,741 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/sv-benchmarks/c/heap-manipulation/dancing_true-unreach-call_false-valid-memtrack.i [2018-11-09 21:48:22,750 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/data/3ed8c5278/acf72801790b415eb8654273d7c1da91/FLAG5241e14d6 [2018-11-09 21:48:22,762 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/data/3ed8c5278/acf72801790b415eb8654273d7c1da91 [2018-11-09 21:48:22,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 21:48:22,765 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-09 21:48:22,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 21:48:22,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 21:48:22,769 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 21:48:22,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:48:22" (1/1) ... [2018-11-09 21:48:22,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b82404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:48:22, skipping insertion in model container [2018-11-09 21:48:22,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:48:22" (1/1) ... [2018-11-09 21:48:22,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 21:48:22,808 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 21:48:23,015 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 21:48:23,020 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 21:48:23,052 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 21:48:23,075 INFO L193 MainTranslator]: Completed translation [2018-11-09 21:48:23,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:48:23 WrapperNode [2018-11-09 21:48:23,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 21:48:23,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 21:48:23,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 21:48:23,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 21:48:23,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:48:23" (1/1) ... [2018-11-09 21:48:23,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:48:23" (1/1) ... [2018-11-09 21:48:23,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:48:23" (1/1) ... [2018-11-09 21:48:23,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:48:23" (1/1) ... [2018-11-09 21:48:23,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:48:23" (1/1) ... [2018-11-09 21:48:23,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:48:23" (1/1) ... [2018-11-09 21:48:23,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:48:23" (1/1) ... [2018-11-09 21:48:23,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 21:48:23,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 21:48:23,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 21:48:23,163 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 21:48:23,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:48:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/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-11-09 21:48:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-09 21:48:23,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 21:48:23,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-09 21:48:23,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-09 21:48:23,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-09 21:48:23,198 INFO L138 BoogieDeclarations]: Found implementation of procedure remove [2018-11-09 21:48:23,198 INFO L138 BoogieDeclarations]: Found implementation of procedure re_insert [2018-11-09 21:48:23,198 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2018-11-09 21:48:23,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-09 21:48:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-09 21:48:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-09 21:48:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-09 21:48:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-09 21:48:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-09 21:48:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-09 21:48:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-09 21:48:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-09 21:48:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-09 21:48:23,199 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-09 21:48:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-09 21:48:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-09 21:48:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-09 21:48:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-09 21:48:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-09 21:48:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-09 21:48:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-09 21:48:23,200 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-09 21:48:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-09 21:48:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-09 21:48:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-09 21:48:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-09 21:48:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-09 21:48:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-09 21:48:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-09 21:48:23,201 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-09 21:48:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-09 21:48:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-09 21:48:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-09 21:48:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-09 21:48:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-09 21:48:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-09 21:48:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-09 21:48:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-09 21:48:23,202 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-09 21:48:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-09 21:48:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-09 21:48:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-09 21:48:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-09 21:48:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-09 21:48:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-09 21:48:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-09 21:48:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-09 21:48:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-09 21:48:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-09 21:48:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-09 21:48:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-09 21:48:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-09 21:48:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-09 21:48:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-09 21:48:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-09 21:48:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-09 21:48:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-09 21:48:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-09 21:48:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-09 21:48:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-09 21:48:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-09 21:48:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-09 21:48:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-09 21:48:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-09 21:48:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-09 21:48:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-09 21:48:23,205 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-09 21:48:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-09 21:48:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-09 21:48:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-09 21:48:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-09 21:48:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-09 21:48:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-09 21:48:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-09 21:48:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-09 21:48:23,206 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-09 21:48:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-09 21:48:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-09 21:48:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-09 21:48:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-09 21:48:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-09 21:48:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-09 21:48:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-09 21:48:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-09 21:48:23,207 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-09 21:48:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-09 21:48:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-09 21:48:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-09 21:48:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-09 21:48:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-09 21:48:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-09 21:48:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-09 21:48:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-09 21:48:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-09 21:48:23,208 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-09 21:48:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-09 21:48:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-09 21:48:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-09 21:48:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-09 21:48:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-09 21:48:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-09 21:48:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-09 21:48:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-09 21:48:23,209 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-09 21:48:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-09 21:48:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-09 21:48:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-09 21:48:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-09 21:48:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-09 21:48:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-09 21:48:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure remove [2018-11-09 21:48:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-09 21:48:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-09 21:48:23,210 INFO L130 BoogieDeclarations]: Found specification of procedure re_insert [2018-11-09 21:48:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2018-11-09 21:48:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-09 21:48:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-09 21:48:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-09 21:48:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-09 21:48:23,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 21:48:23,534 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 21:48:23,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:48:23 BoogieIcfgContainer [2018-11-09 21:48:23,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 21:48:23,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-09 21:48:23,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-09 21:48:23,538 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-09 21:48:23,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:48:22" (1/3) ... [2018-11-09 21:48:23,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386631c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:48:23, skipping insertion in model container [2018-11-09 21:48:23,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:48:23" (2/3) ... [2018-11-09 21:48:23,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@386631c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:48:23, skipping insertion in model container [2018-11-09 21:48:23,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:48:23" (3/3) ... [2018-11-09 21:48:23,540 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing_true-unreach-call_false-valid-memtrack.i [2018-11-09 21:48:23,546 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-09 21:48:23,551 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-09 21:48:23,561 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-09 21:48:23,581 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 21:48:23,581 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-09 21:48:23,581 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-09 21:48:23,582 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-09 21:48:23,582 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 21:48:23,582 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 21:48:23,582 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-09 21:48:23,582 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 21:48:23,582 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-09 21:48:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-11-09 21:48:23,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-09 21:48:23,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:48:23,600 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] [2018-11-09 21:48:23,602 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:48:23,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:48:23,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1479327764, now seen corresponding path program 1 times [2018-11-09 21:48:23,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:48:23,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:48:23,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:23,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:48:23,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:48:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 21:48:23,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 21:48:23,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-09 21:48:23,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-09 21:48:23,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-09 21:48:23,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-09 21:48:23,725 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-11-09 21:48:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:48:23,749 INFO L93 Difference]: Finished difference Result 142 states and 170 transitions. [2018-11-09 21:48:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-09 21:48:23,750 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-11-09 21:48:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:48:23,756 INFO L225 Difference]: With dead ends: 142 [2018-11-09 21:48:23,756 INFO L226 Difference]: Without dead ends: 73 [2018-11-09 21:48:23,758 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-11-09 21:48:23,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-09 21:48:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-11-09 21:48:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-09 21:48:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2018-11-09 21:48:23,785 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 30 [2018-11-09 21:48:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:48:23,785 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2018-11-09 21:48:23,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-09 21:48:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-11-09 21:48:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-09 21:48:23,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:48:23,786 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] [2018-11-09 21:48:23,786 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:48:23,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:48:23,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1298300528, now seen corresponding path program 1 times [2018-11-09 21:48:23,787 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:48:23,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:48:23,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:23,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:48:23,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:48:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 21:48:23,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 21:48:23,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 21:48:23,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-09 21:48:23,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-09 21:48:23,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-09 21:48:23,875 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand 5 states. [2018-11-09 21:48:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:48:23,920 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2018-11-09 21:48:23,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 21:48:23,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-09 21:48:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:48:23,922 INFO L225 Difference]: With dead ends: 81 [2018-11-09 21:48:23,922 INFO L226 Difference]: Without dead ends: 79 [2018-11-09 21:48:23,923 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-11-09 21:48:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-09 21:48:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-09 21:48:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-09 21:48:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-11-09 21:48:23,930 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 31 [2018-11-09 21:48:23,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:48:23,931 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-11-09 21:48:23,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-09 21:48:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-11-09 21:48:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-09 21:48:23,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:48:23,932 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 21:48:23,932 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:48:23,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:48:23,932 INFO L82 PathProgramCache]: Analyzing trace with hash -510574589, now seen corresponding path program 1 times [2018-11-09 21:48:23,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:48:23,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:48:23,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:23,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:48:23,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:48:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-09 21:48:23,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 21:48:23,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-09 21:48:23,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-09 21:48:23,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 21:48:23,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 21:48:23,991 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 4 states. [2018-11-09 21:48:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:48:24,047 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2018-11-09 21:48:24,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 21:48:24,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-09 21:48:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:48:24,049 INFO L225 Difference]: With dead ends: 133 [2018-11-09 21:48:24,049 INFO L226 Difference]: Without dead ends: 98 [2018-11-09 21:48:24,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-09 21:48:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-09 21:48:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2018-11-09 21:48:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-09 21:48:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2018-11-09 21:48:24,059 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 37 [2018-11-09 21:48:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:48:24,059 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2018-11-09 21:48:24,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-09 21:48:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2018-11-09 21:48:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-09 21:48:24,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:48:24,061 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 21:48:24,061 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:48:24,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:48:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash -543102091, now seen corresponding path program 1 times [2018-11-09 21:48:24,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:48:24,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:48:24,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:24,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:48:24,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:48:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-09 21:48:24,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:48:24,134 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/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-11-09 21:48:24,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:48:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:48:24,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:48:24,238 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-11-09 21:48:24,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 21:48:24,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:48:24,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-09 21:48:24,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:48:24,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:48:24,286 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 11 treesize of output 4 [2018-11-09 21:48:24,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 21:48:24,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:48:24,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-09 21:48:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 21:48:24,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:48:24,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-09 21:48:24,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-09 21:48:24,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-09 21:48:24,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-09 21:48:24,324 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand 8 states. [2018-11-09 21:48:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:48:24,591 INFO L93 Difference]: Finished difference Result 172 states and 215 transitions. [2018-11-09 21:48:24,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-09 21:48:24,592 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-09 21:48:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:48:24,594 INFO L225 Difference]: With dead ends: 172 [2018-11-09 21:48:24,595 INFO L226 Difference]: Without dead ends: 113 [2018-11-09 21:48:24,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-09 21:48:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-09 21:48:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2018-11-09 21:48:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-09 21:48:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2018-11-09 21:48:24,606 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 46 [2018-11-09 21:48:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:48:24,606 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2018-11-09 21:48:24,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-09 21:48:24,607 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2018-11-09 21:48:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-09 21:48:24,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:48:24,608 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 21:48:24,609 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:48:24,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:48:24,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1900395545, now seen corresponding path program 1 times [2018-11-09 21:48:24,609 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:48:24,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:48:24,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:24,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:48:24,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:48:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-09 21:48:24,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 21:48:24,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-09 21:48:24,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-09 21:48:24,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-09 21:48:24,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-09 21:48:24,691 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand 6 states. [2018-11-09 21:48:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:48:24,731 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2018-11-09 21:48:24,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-09 21:48:24,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-09 21:48:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:48:24,733 INFO L225 Difference]: With dead ends: 105 [2018-11-09 21:48:24,733 INFO L226 Difference]: Without dead ends: 98 [2018-11-09 21:48:24,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-09 21:48:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-09 21:48:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2018-11-09 21:48:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-09 21:48:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2018-11-09 21:48:24,742 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 50 [2018-11-09 21:48:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:48:24,743 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2018-11-09 21:48:24,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-09 21:48:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2018-11-09 21:48:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-09 21:48:24,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:48:24,744 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 21:48:24,745 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:48:24,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:48:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash -891440923, now seen corresponding path program 1 times [2018-11-09 21:48:24,745 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:48:24,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:48:24,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:24,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:48:24,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:48:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-09 21:48:24,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:48:24,972 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/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-11-09 21:48:24,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:48:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:48:25,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:48:25,095 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-11-09 21:48:25,099 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-11-09 21:48:25,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:48:25,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:48:25,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:48:25,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-09 21:48:25,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:48:25,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:48:25,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:48:25,143 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 16 treesize of output 31 [2018-11-09 21:48:25,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:48:25,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:48:25,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:48:25,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-09 21:48:25,203 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 30 treesize of output 40 [2018-11-09 21:48:25,207 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 31 treesize of output 30 [2018-11-09 21:48:25,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:48:25,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:48:25,260 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:48:25,270 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 26 treesize of output 50 [2018-11-09 21:48:25,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-09 21:48:25,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:48:25,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-09 21:48:25,332 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:67 [2018-11-09 21:48:25,642 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-09 21:48:25,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 21:48:25,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:48:25,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:1 [2018-11-09 21:48:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 21:48:25,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:48:25,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 27 [2018-11-09 21:48:25,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-09 21:48:25,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-09 21:48:25,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-11-09 21:48:25,672 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand 27 states. [2018-11-09 21:48:57,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:48:57,668 INFO L93 Difference]: Finished difference Result 279 states and 365 transitions. [2018-11-09 21:48:57,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-09 21:48:57,669 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-11-09 21:48:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:48:57,672 INFO L225 Difference]: With dead ends: 279 [2018-11-09 21:48:57,672 INFO L226 Difference]: Without dead ends: 233 [2018-11-09 21:48:57,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=366, Invalid=2286, Unknown=0, NotChecked=0, Total=2652 [2018-11-09 21:48:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-09 21:48:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 165. [2018-11-09 21:48:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-09 21:48:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 208 transitions. [2018-11-09 21:48:57,700 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 208 transitions. Word has length 50 [2018-11-09 21:48:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:48:57,700 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 208 transitions. [2018-11-09 21:48:57,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-09 21:48:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 208 transitions. [2018-11-09 21:48:57,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-09 21:48:57,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:48:57,702 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-11-09 21:48:57,702 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:48:57,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:48:57,702 INFO L82 PathProgramCache]: Analyzing trace with hash 887187713, now seen corresponding path program 1 times [2018-11-09 21:48:57,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:48:57,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:48:57,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:57,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:48:57,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:48:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-09 21:48:57,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 21:48:57,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 21:48:57,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-09 21:48:57,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-09 21:48:57,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-09 21:48:57,758 INFO L87 Difference]: Start difference. First operand 165 states and 208 transitions. Second operand 5 states. [2018-11-09 21:48:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:48:57,835 INFO L93 Difference]: Finished difference Result 279 states and 345 transitions. [2018-11-09 21:48:57,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 21:48:57,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-09 21:48:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:48:57,837 INFO L225 Difference]: With dead ends: 279 [2018-11-09 21:48:57,837 INFO L226 Difference]: Without dead ends: 146 [2018-11-09 21:48:57,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-09 21:48:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-09 21:48:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 141. [2018-11-09 21:48:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-09 21:48:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 170 transitions. [2018-11-09 21:48:57,856 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 170 transitions. Word has length 52 [2018-11-09 21:48:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:48:57,856 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 170 transitions. [2018-11-09 21:48:57,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-09 21:48:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 170 transitions. [2018-11-09 21:48:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-09 21:48:57,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:48:57,857 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 21:48:57,858 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:48:57,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:48:57,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1450274399, now seen corresponding path program 1 times [2018-11-09 21:48:57,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:48:57,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:48:57,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:57,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:48:57,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:48:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:48:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-09 21:48:57,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:48:57,927 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/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-11-09 21:48:57,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:48:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:48:57,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:48:58,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-09 21:48:58,021 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 10 treesize of output 9 [2018-11-09 21:48:58,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:48:58,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:48:58,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:48:58,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-11-09 21:48:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 21:48:58,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:48:58,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11] total 13 [2018-11-09 21:48:58,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-09 21:48:58,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-09 21:48:58,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-09 21:48:58,102 INFO L87 Difference]: Start difference. First operand 141 states and 170 transitions. Second operand 13 states. [2018-11-09 21:49:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:49:30,579 INFO L93 Difference]: Finished difference Result 294 states and 374 transitions. [2018-11-09 21:49:30,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-09 21:49:30,580 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-11-09 21:49:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:49:30,581 INFO L225 Difference]: With dead ends: 294 [2018-11-09 21:49:30,581 INFO L226 Difference]: Without dead ends: 187 [2018-11-09 21:49:30,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-11-09 21:49:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-09 21:49:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 143. [2018-11-09 21:49:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-09 21:49:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2018-11-09 21:49:30,599 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 54 [2018-11-09 21:49:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:49:30,599 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2018-11-09 21:49:30,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-09 21:49:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2018-11-09 21:49:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-09 21:49:30,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:49:30,600 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2018-11-09 21:49:30,601 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:49:30,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:49:30,601 INFO L82 PathProgramCache]: Analyzing trace with hash 229343534, now seen corresponding path program 1 times [2018-11-09 21:49:30,601 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:49:30,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:49:30,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:49:30,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:49:30,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:49:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:49:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-09 21:49:30,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 21:49:30,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-09 21:49:30,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-09 21:49:30,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-09 21:49:30,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-09 21:49:30,666 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand 7 states. [2018-11-09 21:49:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:49:30,716 INFO L93 Difference]: Finished difference Result 163 states and 197 transitions. [2018-11-09 21:49:30,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-09 21:49:30,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-11-09 21:49:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:49:30,718 INFO L225 Difference]: With dead ends: 163 [2018-11-09 21:49:30,718 INFO L226 Difference]: Without dead ends: 161 [2018-11-09 21:49:30,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-09 21:49:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-09 21:49:30,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2018-11-09 21:49:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-09 21:49:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 180 transitions. [2018-11-09 21:49:30,732 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 180 transitions. Word has length 61 [2018-11-09 21:49:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:49:30,733 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 180 transitions. [2018-11-09 21:49:30,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-09 21:49:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 180 transitions. [2018-11-09 21:49:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-09 21:49:30,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:49:30,734 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 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] [2018-11-09 21:49:30,734 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:49:30,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:49:30,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1308031796, now seen corresponding path program 1 times [2018-11-09 21:49:30,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:49:30,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:49:30,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:49:30,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:49:30,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:49:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:49:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-09 21:49:31,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:49:31,004 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/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-11-09 21:49:31,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:49:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:49:31,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:49:31,079 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-11-09 21:49:31,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:31,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:31,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-09 21:49:31,147 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:31,149 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:31,149 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 11 treesize of output 4 [2018-11-09 21:49:31,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:31,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:31,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-11-09 21:49:31,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-09 21:49:31,207 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 10 treesize of output 9 [2018-11-09 21:49:31,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:31,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:31,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:31,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2018-11-09 21:49:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-09 21:49:31,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:49:31,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 32 [2018-11-09 21:49:31,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-09 21:49:31,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-09 21:49:31,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992 [2018-11-09 21:49:31,369 INFO L87 Difference]: Start difference. First operand 147 states and 180 transitions. Second operand 32 states. [2018-11-09 21:49:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:49:33,247 INFO L93 Difference]: Finished difference Result 266 states and 336 transitions. [2018-11-09 21:49:33,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-09 21:49:33,248 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 82 [2018-11-09 21:49:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:49:33,249 INFO L225 Difference]: With dead ends: 266 [2018-11-09 21:49:33,249 INFO L226 Difference]: Without dead ends: 153 [2018-11-09 21:49:33,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=381, Invalid=2481, Unknown=0, NotChecked=0, Total=2862 [2018-11-09 21:49:33,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-09 21:49:33,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 116. [2018-11-09 21:49:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-09 21:49:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2018-11-09 21:49:33,263 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 82 [2018-11-09 21:49:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:49:33,263 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2018-11-09 21:49:33,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-09 21:49:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2018-11-09 21:49:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-09 21:49:33,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:49:33,264 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 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-11-09 21:49:33,264 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:49:33,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:49:33,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1836579873, now seen corresponding path program 1 times [2018-11-09 21:49:33,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:49:33,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:49:33,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:49:33,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:49:33,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:49:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:49:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-09 21:49:33,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:49:33,780 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/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-11-09 21:49:33,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:49:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:49:33,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:49:33,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 21:49:33,884 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-11-09 21:49:33,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:33,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:33,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 21:49:33,895 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-11-09 21:49:33,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:33,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:33,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:33,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-11-09 21:49:33,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:49:33,936 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:33,936 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:33,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-11-09 21:49:33,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:33,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:33,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:49:33,954 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:33,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-09 21:49:33,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:33,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:33,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:33,967 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2018-11-09 21:49:34,016 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 28 treesize of output 50 [2018-11-09 21:49:34,018 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 37 treesize of output 36 [2018-11-09 21:49:34,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:34,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:34,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:34,064 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 3 case distinctions, treesize of input 39 treesize of output 54 [2018-11-09 21:49:34,067 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 49 treesize of output 47 [2018-11-09 21:49:34,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:34,085 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:34,086 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 0 case distinctions, treesize of input 24 treesize of output 34 [2018-11-09 21:49:34,086 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:34,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:49:34,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:49:34,109 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:65, output treesize:108 [2018-11-09 21:49:34,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:34,553 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 92 treesize of output 88 [2018-11-09 21:49:34,556 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:34,556 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-09 21:49:34,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:34,568 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 35 treesize of output 25 [2018-11-09 21:49:34,569 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:34,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:34,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:34,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:34,605 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:34,606 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 58 [2018-11-09 21:49:34,616 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 51 [2018-11-09 21:49:34,617 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-09 21:49:34,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:34,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:34,638 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:179, output treesize:44 [2018-11-09 21:49:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-09 21:49:35,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:49:35,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 48 [2018-11-09 21:49:35,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-09 21:49:35,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-09 21:49:35,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2084, Unknown=1, NotChecked=0, Total=2256 [2018-11-09 21:49:35,009 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand 48 states. [2018-11-09 21:49:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:49:38,276 INFO L93 Difference]: Finished difference Result 290 states and 349 transitions. [2018-11-09 21:49:38,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-09 21:49:38,276 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 68 [2018-11-09 21:49:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:49:38,278 INFO L225 Difference]: With dead ends: 290 [2018-11-09 21:49:38,278 INFO L226 Difference]: Without dead ends: 202 [2018-11-09 21:49:38,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=791, Invalid=8138, Unknown=1, NotChecked=0, Total=8930 [2018-11-09 21:49:38,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-09 21:49:38,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 178. [2018-11-09 21:49:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-09 21:49:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 214 transitions. [2018-11-09 21:49:38,292 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 214 transitions. Word has length 68 [2018-11-09 21:49:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:49:38,293 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 214 transitions. [2018-11-09 21:49:38,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-09 21:49:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 214 transitions. [2018-11-09 21:49:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-09 21:49:38,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:49:38,294 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 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-11-09 21:49:38,294 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:49:38,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:49:38,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1068021473, now seen corresponding path program 1 times [2018-11-09 21:49:38,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:49:38,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:49:38,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:49:38,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:49:38,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:49:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:49:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-09 21:49:38,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:49:38,509 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/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-11-09 21:49:38,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:49:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:49:38,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:49:38,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-09 21:49:38,597 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-11-09 21:49:38,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-09 21:49:38,612 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-11-09 21:49:38,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-11-09 21:49:38,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-09 21:49:38,657 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 21 treesize of output 30 [2018-11-09 21:49:38,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-09 21:49:38,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-09 21:49:38,673 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:49:38,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-09 21:49:38,706 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 24 treesize of output 23 [2018-11-09 21:49:38,706 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,717 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-09 21:49:38,728 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:51, output treesize:81 [2018-11-09 21:49:38,980 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-09 21:49:38,982 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-11-09 21:49:38,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,989 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-09 21:49:38,991 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 4 [2018-11-09 21:49:38,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:38,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:14 [2018-11-09 21:49:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-09 21:49:39,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:49:39,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-11-09 21:49:39,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-09 21:49:39,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-09 21:49:39,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-11-09 21:49:39,067 INFO L87 Difference]: Start difference. First operand 178 states and 214 transitions. Second operand 32 states. [2018-11-09 21:49:40,474 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-09 21:49:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:49:41,113 INFO L93 Difference]: Finished difference Result 252 states and 306 transitions. [2018-11-09 21:49:41,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-09 21:49:41,113 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2018-11-09 21:49:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:49:41,114 INFO L225 Difference]: With dead ends: 252 [2018-11-09 21:49:41,114 INFO L226 Difference]: Without dead ends: 195 [2018-11-09 21:49:41,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2018-11-09 21:49:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-09 21:49:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 178. [2018-11-09 21:49:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-09 21:49:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 213 transitions. [2018-11-09 21:49:41,135 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 213 transitions. Word has length 68 [2018-11-09 21:49:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:49:41,135 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 213 transitions. [2018-11-09 21:49:41,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-09 21:49:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2018-11-09 21:49:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-09 21:49:41,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:49:41,137 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 21:49:41,137 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:49:41,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:49:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1991884153, now seen corresponding path program 2 times [2018-11-09 21:49:41,137 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:49:41,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:49:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:49:41,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:49:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:49:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:49:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-09 21:49:41,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 21:49:41,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-09 21:49:41,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-09 21:49:41,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-09 21:49:41,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-09 21:49:41,197 INFO L87 Difference]: Start difference. First operand 178 states and 213 transitions. Second operand 8 states. [2018-11-09 21:49:41,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:49:41,239 INFO L93 Difference]: Finished difference Result 208 states and 251 transitions. [2018-11-09 21:49:41,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-09 21:49:41,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-09 21:49:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:49:41,247 INFO L225 Difference]: With dead ends: 208 [2018-11-09 21:49:41,247 INFO L226 Difference]: Without dead ends: 206 [2018-11-09 21:49:41,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-09 21:49:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-11-09 21:49:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2018-11-09 21:49:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-09 21:49:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 215 transitions. [2018-11-09 21:49:41,270 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 215 transitions. Word has length 70 [2018-11-09 21:49:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:49:41,270 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 215 transitions. [2018-11-09 21:49:41,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-09 21:49:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 215 transitions. [2018-11-09 21:49:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-09 21:49:41,271 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:49:41,271 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 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-11-09 21:49:41,272 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:49:41,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:49:41,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1721743090, now seen corresponding path program 2 times [2018-11-09 21:49:41,272 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:49:41,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:49:41,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:49:41,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 21:49:41,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:49:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:49:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-09 21:49:41,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:49:41,726 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/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-11-09 21:49:41,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-09 21:49:41,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-09 21:49:41,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 21:49:41,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:49:41,800 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-11-09 21:49:41,802 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-11-09 21:49:41,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,813 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-11-09 21:49:41,815 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-11-09 21:49:41,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-11-09 21:49:41,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:49:41,856 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:41,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-09 21:49:41,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:49:41,875 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:41,877 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:41,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-11-09 21:49:41,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,889 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-11-09 21:49:41,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 50 [2018-11-09 21:49:41,936 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 37 treesize of output 36 [2018-11-09 21:49:41,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2018-11-09 21:49:41,975 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 40 treesize of output 39 [2018-11-09 21:49:41,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:41,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:41,996 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:41,998 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 24 treesize of output 34 [2018-11-09 21:49:41,998 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:42,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:49:42,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:49:42,026 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:61, output treesize:100 [2018-11-09 21:49:42,554 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:42,557 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:42,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 118 [2018-11-09 21:49:42,561 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:42,562 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:42,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 95 [2018-11-09 21:49:42,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:42,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:42,634 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:42,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 112 [2018-11-09 21:49:42,651 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:42,652 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 117 treesize of output 120 [2018-11-09 21:49:42,653 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:42,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:49:42,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:49:42,780 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:42,792 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:42,793 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 137 [2018-11-09 21:49:42,796 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:42,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-11-09 21:49:42,797 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:42,811 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:49:42,815 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:42,818 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:42,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 128 [2018-11-09 21:49:42,839 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:49:42,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 128 [2018-11-09 21:49:42,840 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-09 21:49:42,885 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:49:42,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:49:42,961 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:233, output treesize:197 [2018-11-09 21:49:53,583 WARN L179 SmtUtils]: Spent 8.31 s on a formula simplification. DAG size of input: 141 DAG size of output: 52 [2018-11-09 21:50:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-09 21:50:04,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:50:04,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 44 [2018-11-09 21:50:04,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-09 21:50:04,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-09 21:50:04,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1721, Unknown=11, NotChecked=0, Total=1892 [2018-11-09 21:50:04,655 INFO L87 Difference]: Start difference. First operand 180 states and 215 transitions. Second operand 44 states. [2018-11-09 21:50:15,429 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2018-11-09 21:50:22,246 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 98 [2018-11-09 21:50:26,453 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2018-11-09 21:50:37,228 WARN L179 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 86 DAG size of output: 81 [2018-11-09 21:50:37,547 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2018-11-09 21:50:39,837 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 108 [2018-11-09 21:51:06,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:51:06,889 INFO L93 Difference]: Finished difference Result 282 states and 330 transitions. [2018-11-09 21:51:06,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-09 21:51:06,890 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 77 [2018-11-09 21:51:06,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:51:06,890 INFO L225 Difference]: With dead ends: 282 [2018-11-09 21:51:06,891 INFO L226 Difference]: Without dead ends: 187 [2018-11-09 21:51:06,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2588 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=738, Invalid=6902, Unknown=16, NotChecked=0, Total=7656 [2018-11-09 21:51:06,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-09 21:51:06,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 163. [2018-11-09 21:51:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-09 21:51:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2018-11-09 21:51:06,908 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 77 [2018-11-09 21:51:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:51:06,908 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2018-11-09 21:51:06,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-09 21:51:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2018-11-09 21:51:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-09 21:51:06,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:51:06,909 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 21:51:06,909 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:51:06,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:51:06,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1985329031, now seen corresponding path program 1 times [2018-11-09 21:51:06,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:51:06,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:51:06,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:51:06,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 21:51:06,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:51:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:51:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-09 21:51:06,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:51:06,961 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 21:51:06,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:51:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:51:06,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:51:07,016 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-11-09 21:51:07,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-09 21:51:07,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 21:51:07,076 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-11-09 21:51:07,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 21:51:07,090 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-11-09 21:51:07,090 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,100 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-11-09 21:51:07,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:51:07,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,120 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:07,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-11-09 21:51:07,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:51:07,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-09 21:51:07,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-11-09 21:51:07,205 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 30 treesize of output 52 [2018-11-09 21:51:07,208 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 39 treesize of output 38 [2018-11-09 21:51:07,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,257 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 3 case distinctions, treesize of input 43 treesize of output 60 [2018-11-09 21:51:07,260 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 55 treesize of output 51 [2018-11-09 21:51:07,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,281 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:07,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,282 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:07,283 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 26 treesize of output 51 [2018-11-09 21:51:07,283 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:51:07,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:51:07,314 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:80, output treesize:138 [2018-11-09 21:51:07,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,419 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 81 treesize of output 75 [2018-11-09 21:51:07,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,455 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 66 treesize of output 60 [2018-11-09 21:51:07,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:51:07,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:148, output treesize:136 [2018-11-09 21:51:07,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,606 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 97 treesize of output 137 [2018-11-09 21:51:07,609 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 122 treesize of output 121 [2018-11-09 21:51:07,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,762 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 82 treesize of output 83 [2018-11-09 21:51:07,764 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-11-09 21:51:07,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,830 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 78 treesize of output 87 [2018-11-09 21:51:07,831 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-11-09 21:51:07,831 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,847 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:07,906 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 3 case distinctions, treesize of input 105 treesize of output 123 [2018-11-09 21:51:07,909 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-11-09 21:51:07,909 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:07,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,000 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 95 treesize of output 98 [2018-11-09 21:51:08,001 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-09 21:51:08,062 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:51:08,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-09 21:51:08,121 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:180, output treesize:269 [2018-11-09 21:51:08,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,230 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 3 case distinctions, treesize of input 127 treesize of output 143 [2018-11-09 21:51:08,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,235 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 138 treesize of output 145 [2018-11-09 21:51:08,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:08,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,325 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,332 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 119 treesize of output 142 [2018-11-09 21:51:08,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-09 21:51:08,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:51:08,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,658 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,659 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:08,664 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 107 treesize of output 119 [2018-11-09 21:51:08,667 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,667 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:08,668 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 27 treesize of output 66 [2018-11-09 21:51:08,668 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:08,694 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:08,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,881 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 127 treesize of output 126 [2018-11-09 21:51:08,888 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:08,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 25 [2018-11-09 21:51:08,889 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:08,911 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:09,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,052 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:09,055 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:09,056 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 127 [2018-11-09 21:51:09,058 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:09,059 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,059 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:09,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 34 treesize of output 52 [2018-11-09 21:51:09,060 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:09,083 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:09,086 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,101 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 123 treesize of output 165 [2018-11-09 21:51:09,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,105 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:09,106 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:09,106 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 143 treesize of output 188 [2018-11-09 21:51:09,107 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:09,190 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,190 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:09,191 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 132 [2018-11-09 21:51:09,191 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:09,240 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:09,367 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 117 [2018-11-09 21:51:09,370 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,370 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:09,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-11-09 21:51:09,371 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:09,394 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:09,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,511 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 112 treesize of output 111 [2018-11-09 21:51:09,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,514 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 16 treesize of output 31 [2018-11-09 21:51:09,515 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:09,535 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:09,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-09 21:51:09,633 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:347, output treesize:472 [2018-11-09 21:51:09,771 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-11-09 21:51:09,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 187 treesize of output 213 [2018-11-09 21:51:09,812 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 204 treesize of output 197 [2018-11-09 21:51:09,814 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-09 21:51:09,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,914 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,915 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:09,918 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:09,919 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 165 treesize of output 198 [2018-11-09 21:51:09,919 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:09,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:51:10,805 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:10,806 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:10,808 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 203 treesize of output 188 [2018-11-09 21:51:10,810 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:10,812 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 0 case distinctions, treesize of input 45 treesize of output 47 [2018-11-09 21:51:10,813 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:10,832 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:11,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:11,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:11,414 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:11,415 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 166 treesize of output 182 [2018-11-09 21:51:11,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:11,418 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 0 case distinctions, treesize of input 112 treesize of output 97 [2018-11-09 21:51:11,418 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:11,435 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:11,843 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 158 [2018-11-09 21:51:11,846 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:11,847 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:11,849 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:11,852 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 35 treesize of output 71 [2018-11-09 21:51:11,852 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:11,880 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:12,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:12,201 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 139 treesize of output 132 [2018-11-09 21:51:12,204 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:12,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:12,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 117 [2018-11-09 21:51:12,205 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:12,226 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:12,478 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:12,479 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 189 treesize of output 147 [2018-11-09 21:51:12,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:12,482 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 177 [2018-11-09 21:51:12,482 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:12,504 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:12,706 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 196 treesize of output 185 [2018-11-09 21:51:12,708 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:12,710 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 0 case distinctions, treesize of input 63 treesize of output 75 [2018-11-09 21:51:12,710 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:12,726 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:12,854 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 160 treesize of output 158 [2018-11-09 21:51:12,858 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 155 treesize of output 143 [2018-11-09 21:51:12,858 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:12,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:12,954 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:12,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 162 [2018-11-09 21:51:12,966 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-09 21:51:13,052 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 21:51:13,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-09 21:51:13,151 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 12 variables, input treesize:740, output treesize:526 [2018-11-09 21:51:13,400 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2018-11-09 21:51:15,921 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:15,926 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 148 treesize of output 137 [2018-11-09 21:51:15,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:15,930 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 47 treesize of output 49 [2018-11-09 21:51:15,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:15,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:16,116 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:16,116 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:16,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:16,118 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:16,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 154 [2018-11-09 21:51:16,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:16,124 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:16,125 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:16,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 129 [2018-11-09 21:51:16,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:16,146 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:16,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 158 treesize of output 159 [2018-11-09 21:51:16,287 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:16,289 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 153 treesize of output 156 [2018-11-09 21:51:16,289 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:16,422 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:16,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:16,424 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:16,426 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:16,431 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 212 [2018-11-09 21:51:16,431 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-09 21:51:16,553 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-09 21:51:16,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:16,755 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 186 treesize of output 132 [2018-11-09 21:51:16,757 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:16,758 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 77 [2018-11-09 21:51:16,758 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:16,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:16,774 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 46 treesize of output 35 [2018-11-09 21:51:16,774 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:16,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:16,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:16,974 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 72 treesize of output 61 [2018-11-09 21:51:16,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:16,977 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:16,977 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:16,979 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 31 treesize of output 51 [2018-11-09 21:51:16,979 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:16,988 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,116 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 103 [2018-11-09 21:51:17,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,128 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 55 [2018-11-09 21:51:17,129 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-09 21:51:17,144 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,145 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2018-11-09 21:51:17,145 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,154 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,265 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 149 [2018-11-09 21:51:17,269 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:17,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,270 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:17,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,271 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:17,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-11-09 21:51:17,272 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,355 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 121 treesize of output 119 [2018-11-09 21:51:17,358 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,425 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:51:17,426 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 129 [2018-11-09 21:51:17,426 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,538 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 123 treesize of output 114 [2018-11-09 21:51:17,538 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,592 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 106 treesize of output 94 [2018-11-09 21:51:17,592 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,644 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,645 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 96 [2018-11-09 21:51:17,645 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,735 INFO L267 ElimStorePlain]: Start of recursive call 17: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 21:51:17,743 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 135 [2018-11-09 21:51:17,745 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,746 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 123 [2018-11-09 21:51:17,746 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,794 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 113 treesize of output 104 [2018-11-09 21:51:17,794 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,836 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94 [2018-11-09 21:51:17,837 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,876 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 119 treesize of output 117 [2018-11-09 21:51:17,880 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:17,916 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 104 treesize of output 92 [2018-11-09 21:51:17,917 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:17,950 INFO L267 ElimStorePlain]: Start of recursive call 24: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:51:18,034 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 101 [2018-11-09 21:51:18,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:18,036 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2018-11-09 21:51:18,036 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:18,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:51:18,052 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 35 treesize of output 24 [2018-11-09 21:51:18,052 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-09 21:51:18,062 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:51:18,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-11-09 21:51:18,122 INFO L202 ElimStorePlain]: Needed 32 recursive calls to eliminate 12 variables, input treesize:651, output treesize:376 [2018-11-09 21:51:18,889 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-09 21:51:19,506 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 54 [2018-11-09 21:51:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-09 21:51:19,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:51:19,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33] total 36 [2018-11-09 21:51:19,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-09 21:51:19,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-09 21:51:19,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1139, Unknown=3, NotChecked=0, Total=1260 [2018-11-09 21:51:19,599 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand 36 states. [2018-11-09 21:51:30,433 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2018-11-09 21:51:30,640 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2018-11-09 21:51:31,023 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-11-09 21:51:33,328 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2018-11-09 21:51:37,620 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2018-11-09 21:51:37,875 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 116 [2018-11-09 21:51:38,307 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 185 [2018-11-09 21:51:38,845 WARN L179 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 187 [2018-11-09 21:51:39,466 WARN L179 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 186 [2018-11-09 21:51:39,765 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 123 [2018-11-09 21:51:40,282 WARN L179 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 188 [2018-11-09 21:51:40,595 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 125 [2018-11-09 21:51:56,987 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 156 [2018-11-09 21:51:59,760 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 187 [2018-11-09 21:52:00,058 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 118 [2018-11-09 21:52:04,639 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 63 [2018-11-09 21:52:05,142 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-11-09 21:52:05,689 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-11-09 21:52:14,732 WARN L179 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 114 DAG size of output: 68 [2018-11-09 21:52:15,337 WARN L179 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 66 [2018-11-09 21:52:15,813 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2018-11-09 21:52:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:52:16,040 INFO L93 Difference]: Finished difference Result 400 states and 477 transitions. [2018-11-09 21:52:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-09 21:52:16,040 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-11-09 21:52:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:52:16,041 INFO L225 Difference]: With dead ends: 400 [2018-11-09 21:52:16,041 INFO L226 Difference]: Without dead ends: 275 [2018-11-09 21:52:16,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=611, Invalid=5864, Unknown=5, NotChecked=0, Total=6480 [2018-11-09 21:52:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-09 21:52:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 242. [2018-11-09 21:52:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-09 21:52:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 290 transitions. [2018-11-09 21:52:16,069 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 290 transitions. Word has length 79 [2018-11-09 21:52:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:52:16,070 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 290 transitions. [2018-11-09 21:52:16,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-09 21:52:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 290 transitions. [2018-11-09 21:52:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-09 21:52:16,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:52:16,071 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 21:52:16,071 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:52:16,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:52:16,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1896994557, now seen corresponding path program 1 times [2018-11-09 21:52:16,072 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:52:16,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:52:16,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:52:16,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:52:16,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:52:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:52:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-09 21:52:16,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:52:16,338 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 21:52:16,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:52:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:52:16,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:52:16,410 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-11-09 21:52:16,411 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-11-09 21:52:16,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:52:16,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:52:16,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:52:16,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-09 21:52:16,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:52:16,445 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:52:16,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:52:16,447 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 16 treesize of output 31 [2018-11-09 21:52:16,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:52:16,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:52:16,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:52:16,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-09 21:52:16,515 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 30 treesize of output 40 [2018-11-09 21:52:16,518 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 31 treesize of output 30 [2018-11-09 21:52:16,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:52:16,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:52:16,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:52:16,545 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 26 treesize of output 50 [2018-11-09 21:52:16,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-09 21:52:16,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:52:16,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-09 21:52:16,579 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:40, output treesize:67 [2018-11-09 21:52:16,857 WARN L854 $PredicateComparison]: unable to prove that (exists ((|remove_#t~mem7.offset| Int) (|remove_#t~mem8.base| Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_remove_#in~x.base|) |c_remove_#in~x.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) (+ |remove_#t~mem7.offset| 4) |remove_#t~mem8.base|))))) is different from true [2018-11-09 21:52:16,875 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 57 treesize of output 57 [2018-11-09 21:52:16,882 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 48 treesize of output 57 [2018-11-09 21:52:16,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-09 21:52:16,918 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:52:16,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:52:16,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:52:16,923 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:52:16,923 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:52:16,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 88 [2018-11-09 21:52:16,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-11-09 21:52:17,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-09 21:52:17,104 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:52:17,108 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-11-09 21:52:17,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:52:17,120 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 4 case distinctions, treesize of input 28 treesize of output 49 [2018-11-09 21:52:17,120 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-09 21:52:17,144 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 21:52:17,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 9 xjuncts. [2018-11-09 21:52:17,236 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:109, output treesize:265 [2018-11-09 21:52:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-09 21:52:17,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:52:17,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 39 [2018-11-09 21:52:17,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-09 21:52:17,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-09 21:52:17,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1274, Unknown=1, NotChecked=72, Total=1482 [2018-11-09 21:52:17,667 INFO L87 Difference]: Start difference. First operand 242 states and 290 transitions. Second operand 39 states. [2018-11-09 21:52:35,602 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-11-09 21:52:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:52:57,179 INFO L93 Difference]: Finished difference Result 323 states and 383 transitions. [2018-11-09 21:52:57,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-09 21:52:57,180 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2018-11-09 21:52:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:52:57,181 INFO L225 Difference]: With dead ends: 323 [2018-11-09 21:52:57,181 INFO L226 Difference]: Without dead ends: 261 [2018-11-09 21:52:57,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=623, Invalid=5044, Unknown=37, NotChecked=148, Total=5852 [2018-11-09 21:52:57,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-09 21:52:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 231. [2018-11-09 21:52:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-09 21:52:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2018-11-09 21:52:57,225 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 82 [2018-11-09 21:52:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:52:57,225 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2018-11-09 21:52:57,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-09 21:52:57,225 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2018-11-09 21:52:57,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-09 21:52:57,227 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:52:57,227 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-09 21:52:57,227 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:52:57,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:52:57,227 INFO L82 PathProgramCache]: Analyzing trace with hash -753760568, now seen corresponding path program 1 times [2018-11-09 21:52:57,227 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:52:57,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:52:57,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:52:57,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:52:57,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:52:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:52:57,482 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2018-11-09 21:52:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-09 21:52:58,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:52:58,132 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 21:52:58,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:52:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:52:58,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:52:58,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-09 21:52:58,347 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-11-09 21:52:58,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:52:58,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:52:58,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:52:58,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-09 21:52:58,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-09 21:52:58,401 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:52:58,402 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 19 treesize of output 18 [2018-11-09 21:52:58,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:52:58,416 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-11-09 21:52:58,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 21:52:58,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:52:58,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-09 21:52:58,439 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-11-09 21:52:58,439 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 21:52:58,441 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:52:58,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:52:58,452 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:44, output treesize:63 [2018-11-09 21:52:59,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2018-11-09 21:52:59,051 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 56 treesize of output 51 [2018-11-09 21:52:59,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:52:59,076 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:52:59,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-11-09 21:52:59,077 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 21:52:59,097 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:52:59,098 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:52:59,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-11-09 21:52:59,098 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:52:59,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:52:59,144 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 30 treesize of output 34 [2018-11-09 21:52:59,145 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 25 treesize of output 18 [2018-11-09 21:52:59,146 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 21:52:59,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-11-09 21:52:59,159 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-09 21:52:59,166 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:52:59,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:52:59,192 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:273, output treesize:14 [2018-11-09 21:52:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 47 proven. 27 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-09 21:52:59,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:52:59,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-11-09 21:52:59,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-09 21:52:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-09 21:52:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1660, Unknown=0, NotChecked=0, Total=1806 [2018-11-09 21:52:59,279 INFO L87 Difference]: Start difference. First operand 231 states and 278 transitions. Second operand 43 states. [2018-11-09 21:53:01,605 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 58 [2018-11-09 21:53:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:53:02,521 INFO L93 Difference]: Finished difference Result 455 states and 557 transitions. [2018-11-09 21:53:02,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-09 21:53:02,521 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 95 [2018-11-09 21:53:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:53:02,522 INFO L225 Difference]: With dead ends: 455 [2018-11-09 21:53:02,522 INFO L226 Difference]: Without dead ends: 308 [2018-11-09 21:53:02,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=645, Invalid=4467, Unknown=0, NotChecked=0, Total=5112 [2018-11-09 21:53:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-09 21:53:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 263. [2018-11-09 21:53:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-09 21:53:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2018-11-09 21:53:02,574 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 95 [2018-11-09 21:53:02,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:53:02,574 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2018-11-09 21:53:02,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-09 21:53:02,574 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2018-11-09 21:53:02,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-09 21:53:02,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:53:02,575 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 21:53:02,576 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:53:02,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:53:02,576 INFO L82 PathProgramCache]: Analyzing trace with hash 788161381, now seen corresponding path program 1 times [2018-11-09 21:53:02,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:53:02,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:53:02,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:53:02,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:53:02,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:53:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:53:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-09 21:53:02,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:53:02,915 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 21:53:02,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:53:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:53:02,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:53:03,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 21:53:03,032 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-11-09 21:53:03,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:53:03,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:53:03,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:53:03,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-09 21:53:03,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:53:03,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:53:03,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:53:03,071 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 16 treesize of output 31 [2018-11-09 21:53:03,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:53:03,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:53:03,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:53:03,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-11-09 21:53:03,122 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 3 case distinctions, treesize of input 30 treesize of output 40 [2018-11-09 21:53:03,123 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 31 treesize of output 30 [2018-11-09 21:53:03,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:53:03,148 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 26 treesize of output 46 [2018-11-09 21:53:03,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-09 21:53:03,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:53:03,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-09 21:53:03,180 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:75 [2018-11-09 21:53:03,567 WARN L854 $PredicateComparison]: unable to prove that (exists ((|remove_#t~mem7.offset| Int) (|remove_#t~mem8.base| Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_remove_#in~x.base|) |c_remove_#in~x.offset|))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) (+ |remove_#t~mem7.offset| 4) |remove_#t~mem8.base|))))) is different from true [2018-11-09 21:53:03,584 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 61 treesize of output 61 [2018-11-09 21:53:03,592 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 52 treesize of output 61 [2018-11-09 21:53:03,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-09 21:53:03,641 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:53:03,642 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:53:03,645 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:53:03,646 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:53:03,647 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:53:03,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 88 [2018-11-09 21:53:03,662 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-11-09 21:53:03,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-09 21:53:03,841 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:53:03,844 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-11-09 21:53:03,846 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:53:03,856 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 4 case distinctions, treesize of input 28 treesize of output 49 [2018-11-09 21:53:03,857 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-09 21:53:03,887 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 21:53:03,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 9 xjuncts. [2018-11-09 21:53:03,981 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:113, output treesize:273 [2018-11-09 21:53:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-09 21:53:10,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:53:10,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2018-11-09 21:53:10,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-09 21:53:10,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-09 21:53:10,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1492, Unknown=7, NotChecked=78, Total=1722 [2018-11-09 21:53:10,508 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand 42 states. [2018-11-09 21:54:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:54:28,013 INFO L93 Difference]: Finished difference Result 322 states and 388 transitions. [2018-11-09 21:54:28,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-09 21:54:28,013 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 85 [2018-11-09 21:54:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:54:28,015 INFO L225 Difference]: With dead ends: 322 [2018-11-09 21:54:28,015 INFO L226 Difference]: Without dead ends: 300 [2018-11-09 21:54:28,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=749, Invalid=6181, Unknown=46, NotChecked=164, Total=7140 [2018-11-09 21:54:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-09 21:54:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 261. [2018-11-09 21:54:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-11-09 21:54:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 313 transitions. [2018-11-09 21:54:28,050 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 313 transitions. Word has length 85 [2018-11-09 21:54:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:54:28,050 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 313 transitions. [2018-11-09 21:54:28,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-09 21:54:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 313 transitions. [2018-11-09 21:54:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-09 21:54:28,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:54:28,052 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 21:54:28,052 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:54:28,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:54:28,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1579481067, now seen corresponding path program 1 times [2018-11-09 21:54:28,052 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:54:28,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:54:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:54:28,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:54:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:54:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:54:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-09 21:54:28,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:54:28,510 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 21:54:28,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:54:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:54:28,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:54:28,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 21:54:28,630 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-11-09 21:54:28,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-09 21:54:28,641 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-11-09 21:54:28,641 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-11-09 21:54:28,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:54:28,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-09 21:54:28,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:54:28,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:28,699 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:28,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-11-09 21:54:28,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,713 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2018-11-09 21:54:28,758 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 28 treesize of output 50 [2018-11-09 21:54:28,760 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 37 treesize of output 36 [2018-11-09 21:54:28,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:28,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 54 [2018-11-09 21:54:28,798 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 49 treesize of output 47 [2018-11-09 21:54:28,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,816 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:28,817 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 0 case distinctions, treesize of input 24 treesize of output 34 [2018-11-09 21:54:28,817 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:28,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:28,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:28,853 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:65, output treesize:108 [2018-11-09 21:54:29,099 WARN L854 $PredicateComparison]: unable to prove that (exists ((|remove_#t~mem8.offset| Int) (|remove_#t~mem7.offset| Int) (|remove_#t~mem8.base| Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_remove_#in~x.base|) |c_remove_#in~x.offset|)) (.cse1 (+ |remove_#t~mem7.offset| 4))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 |remove_#t~mem8.base|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 |remove_#t~mem8.offset|)))))) is different from true [2018-11-09 21:54:29,104 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:29,107 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2018-11-09 21:54:29,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:29,125 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 4 case distinctions, treesize of input 45 treesize of output 62 [2018-11-09 21:54:29,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-09 21:54:29,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 21:54:29,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:29,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:29,257 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 100 [2018-11-09 21:54:29,279 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-11-09 21:54:29,280 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-09 21:54:29,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:29,432 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 93 treesize of output 88 [2018-11-09 21:54:29,434 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:29,435 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 20 treesize of output 19 [2018-11-09 21:54:29,435 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:29,447 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:29,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:29,456 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 91 treesize of output 94 [2018-11-09 21:54:29,464 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 20 treesize of output 31 [2018-11-09 21:54:29,465 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-09 21:54:29,486 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:29,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2018-11-09 21:54:29,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:29,595 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:29,597 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 23 treesize of output 33 [2018-11-09 21:54:29,597 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:29,607 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:29,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-11-09 21:54:29,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:29,622 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 4 case distinctions, treesize of input 23 treesize of output 49 [2018-11-09 21:54:29,622 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-11-09 21:54:29,651 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 21:54:29,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 59 [2018-11-09 21:54:29,656 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:29,657 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 23 treesize of output 31 [2018-11-09 21:54:29,658 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:29,668 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:29,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-09 21:54:29,742 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 10 variables, input treesize:192, output treesize:227 [2018-11-09 21:54:30,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:30,278 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 40 treesize of output 52 [2018-11-09 21:54:30,280 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 30 treesize of output 22 [2018-11-09 21:54:30,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:30,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:30,296 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-11-09 21:54:30,297 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-11-09 21:54:30,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:30,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:30,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:30,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:34 [2018-11-09 21:54:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-09 21:54:30,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:54:30,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 48 [2018-11-09 21:54:30,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-09 21:54:30,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-09 21:54:30,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1986, Unknown=5, NotChecked=90, Total=2256 [2018-11-09 21:54:30,558 INFO L87 Difference]: Start difference. First operand 261 states and 313 transitions. Second operand 48 states. [2018-11-09 21:54:34,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:54:34,655 INFO L93 Difference]: Finished difference Result 401 states and 473 transitions. [2018-11-09 21:54:34,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-09 21:54:34,656 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 85 [2018-11-09 21:54:34,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:54:34,657 INFO L225 Difference]: With dead ends: 401 [2018-11-09 21:54:34,657 INFO L226 Difference]: Without dead ends: 351 [2018-11-09 21:54:34,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=992, Invalid=9057, Unknown=55, NotChecked=198, Total=10302 [2018-11-09 21:54:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-11-09 21:54:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 295. [2018-11-09 21:54:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-11-09 21:54:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 350 transitions. [2018-11-09 21:54:34,708 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 350 transitions. Word has length 85 [2018-11-09 21:54:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:54:34,708 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 350 transitions. [2018-11-09 21:54:34,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-09 21:54:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 350 transitions. [2018-11-09 21:54:34,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-09 21:54:34,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:54:34,709 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-09 21:54:34,709 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:54:34,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:54:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1697389941, now seen corresponding path program 1 times [2018-11-09 21:54:34,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:54:34,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:54:34,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:54:34,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:54:34,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:54:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:54:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-09 21:54:35,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:54:35,073 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 21:54:35,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:54:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:54:35,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:54:35,171 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-11-09 21:54:35,173 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-11-09 21:54:35,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-09 21:54:35,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:54:35,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,206 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 16 treesize of output 31 [2018-11-09 21:54:35,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-11-09 21:54:35,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-11-09 21:54:35,254 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 31 treesize of output 30 [2018-11-09 21:54:35,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,269 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:35,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,270 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:35,271 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 0 case distinctions, treesize of input 26 treesize of output 55 [2018-11-09 21:54:35,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:35,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:35,295 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:46, output treesize:83 [2018-11-09 21:54:35,492 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 54 treesize of output 58 [2018-11-09 21:54:35,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 55 treesize of output 54 [2018-11-09 21:54:35,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,562 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 56 treesize of output 81 [2018-11-09 21:54:35,565 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 65 treesize of output 64 [2018-11-09 21:54:35,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:35,641 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:103 [2018-11-09 21:54:35,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,717 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 3 case distinctions, treesize of input 63 treesize of output 78 [2018-11-09 21:54:35,721 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:35,722 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-11-09 21:54:35,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,781 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 58 treesize of output 73 [2018-11-09 21:54:35,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:35,869 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,889 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 65 treesize of output 88 [2018-11-09 21:54:35,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,893 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 72 treesize of output 87 [2018-11-09 21:54:35,894 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:35,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,970 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:35,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:35,973 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 65 treesize of output 94 [2018-11-09 21:54:35,973 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,016 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:36,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-09 21:54:36,071 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:129, output treesize:230 [2018-11-09 21:54:36,205 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:36,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:36,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:36,208 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 89 [2018-11-09 21:54:36,211 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:36,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:36,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:36,228 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 123 [2018-11-09 21:54:36,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-09 21:54:36,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:36,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:36,330 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 4 case distinctions, treesize of input 89 treesize of output 98 [2018-11-09 21:54:36,333 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 97 treesize of output 90 [2018-11-09 21:54:36,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,372 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 0 case distinctions, treesize of input 57 treesize of output 57 [2018-11-09 21:54:36,372 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:36,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:36,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 94 [2018-11-09 21:54:36,482 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 91 treesize of output 83 [2018-11-09 21:54:36,482 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,523 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:36,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:36,525 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 93 [2018-11-09 21:54:36,525 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,561 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:36,627 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 51 treesize of output 44 [2018-11-09 21:54:36,629 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 14 treesize of output 13 [2018-11-09 21:54:36,629 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,636 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,638 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 73 treesize of output 66 [2018-11-09 21:54:36,640 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 14 treesize of output 13 [2018-11-09 21:54:36,640 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,649 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2018-11-09 21:54:36,653 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 14 treesize of output 13 [2018-11-09 21:54:36,653 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,663 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,665 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 68 treesize of output 61 [2018-11-09 21:54:36,667 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 14 treesize of output 13 [2018-11-09 21:54:36,667 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,675 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:36,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-09 21:54:36,719 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 5 variables, input treesize:280, output treesize:248 [2018-11-09 21:54:37,664 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:37,665 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 0 case distinctions, treesize of input 129 treesize of output 129 [2018-11-09 21:54:37,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-09 21:54:37,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:37,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:38,658 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:38,659 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 0 case distinctions, treesize of input 97 treesize of output 97 [2018-11-09 21:54:38,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-09 21:54:38,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:38,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:39,283 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 145 treesize of output 153 [2018-11-09 21:54:39,285 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 144 treesize of output 137 [2018-11-09 21:54:39,285 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:39,334 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 126 treesize of output 121 [2018-11-09 21:54:39,334 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:39,364 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:39,484 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 127 treesize of output 135 [2018-11-09 21:54:39,486 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:39,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 108 [2018-11-09 21:54:39,487 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:39,527 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:39,648 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 89 treesize of output 93 [2018-11-09 21:54:39,650 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 84 treesize of output 77 [2018-11-09 21:54:39,651 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:39,684 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 70 treesize of output 65 [2018-11-09 21:54:39,684 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:39,704 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:39,813 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:39,814 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 0 case distinctions, treesize of input 115 treesize of output 115 [2018-11-09 21:54:39,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-09 21:54:39,816 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:39,829 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:39,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 24 dim-0 vars, 16 dim-2 vars, End of recursive call: 9 dim-0 vars, and 6 xjuncts. [2018-11-09 21:54:39,931 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 40 variables, input treesize:1853, output treesize:551 [2018-11-09 21:54:40,306 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:40,306 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 9 variables, input treesize:233, output treesize:1 [2018-11-09 21:54:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 65 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-09 21:54:40,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:54:40,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 44 [2018-11-09 21:54:40,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-09 21:54:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-09 21:54:40,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1703, Unknown=5, NotChecked=0, Total=1892 [2018-11-09 21:54:40,378 INFO L87 Difference]: Start difference. First operand 295 states and 350 transitions. Second operand 44 states. [2018-11-09 21:54:40,955 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-11-09 21:54:41,099 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 86 [2018-11-09 21:54:41,299 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 90 [2018-11-09 21:54:41,494 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-11-09 21:54:41,902 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2018-11-09 21:54:42,202 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2018-11-09 21:54:42,464 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 80 [2018-11-09 21:54:42,602 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-11-09 21:54:42,743 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 57 [2018-11-09 21:54:42,962 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 61 [2018-11-09 21:54:43,149 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 70 [2018-11-09 21:54:43,333 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2018-11-09 21:54:43,544 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 69 [2018-11-09 21:54:43,727 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2018-11-09 21:54:44,136 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-11-09 21:54:45,174 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 112 [2018-11-09 21:54:45,334 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 107 [2018-11-09 21:54:45,628 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 77 [2018-11-09 21:54:45,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:54:45,921 INFO L93 Difference]: Finished difference Result 426 states and 499 transitions. [2018-11-09 21:54:45,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-09 21:54:45,921 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 95 [2018-11-09 21:54:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:54:45,923 INFO L225 Difference]: With dead ends: 426 [2018-11-09 21:54:45,923 INFO L226 Difference]: Without dead ends: 314 [2018-11-09 21:54:45,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1905 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=948, Invalid=6182, Unknown=10, NotChecked=0, Total=7140 [2018-11-09 21:54:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-09 21:54:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 292. [2018-11-09 21:54:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-09 21:54:45,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2018-11-09 21:54:45,989 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 95 [2018-11-09 21:54:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:54:45,990 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2018-11-09 21:54:45,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-09 21:54:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2018-11-09 21:54:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-09 21:54:45,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:54:45,991 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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, 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-11-09 21:54:45,991 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:54:45,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:54:45,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1294142025, now seen corresponding path program 1 times [2018-11-09 21:54:45,991 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:54:45,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:54:45,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:54:45,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:54:45,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:54:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:54:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-09 21:54:46,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:54:46,579 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 21:54:46,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:54:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:54:46,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:54:46,624 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-11-09 21:54:46,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, 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-11-09 21:54:46,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:46,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:46,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:46,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-09 21:54:46,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-09 21:54:46,652 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-11-09 21:54:46,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:46,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:46,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:54:46,664 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:46,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-09 21:54:46,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:46,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:46,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:46,675 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-11-09 21:54:46,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 47 [2018-11-09 21:54:46,713 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 32 treesize of output 31 [2018-11-09 21:54:46,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:46,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:46,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 51 [2018-11-09 21:54:46,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:46,761 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 2 case distinctions, treesize of input 37 treesize of output 55 [2018-11-09 21:54:46,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-09 21:54:46,789 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 40 treesize of output 39 [2018-11-09 21:54:46,790 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:46,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:46,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-09 21:54:46,818 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:58, output treesize:90 [2018-11-09 21:54:47,060 WARN L854 $PredicateComparison]: unable to prove that (exists ((|remove_#t~mem8.offset| Int) (|remove_#t~mem7.offset| Int) (|remove_#t~mem8.base| Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_remove_#in~x.base|) |c_remove_#in~x.offset|)) (.cse1 (+ |remove_#t~mem7.offset| 4))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 |remove_#t~mem8.base|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 |remove_#t~mem8.offset|)))))) is different from true [2018-11-09 21:54:47,065 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:47,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2018-11-09 21:54:47,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:47,082 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 4 case distinctions, treesize of input 45 treesize of output 62 [2018-11-09 21:54:47,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-09 21:54:47,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-09 21:54:47,188 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 57 treesize of output 52 [2018-11-09 21:54:47,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, 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-11-09 21:54:47,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-09 21:54:47,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:47,210 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 55 treesize of output 50 [2018-11-09 21:54:47,212 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:47,213 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 18 treesize of output 17 [2018-11-09 21:54:47,213 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:47,221 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:47,223 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 55 treesize of output 50 [2018-11-09 21:54:47,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:47,226 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 18 treesize of output 27 [2018-11-09 21:54:47,226 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:47,235 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:47,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 90 [2018-11-09 21:54:47,326 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 87 treesize of output 96 [2018-11-09 21:54:47,327 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-09 21:54:47,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:47,409 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:47,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 76 treesize of output 115 [2018-11-09 21:54:47,430 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 16 xjuncts. [2018-11-09 21:54:47,603 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-09 21:54:47,798 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 86 treesize of output 81 [2018-11-09 21:54:47,799 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:47,800 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 21 [2018-11-09 21:54:47,801 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:47,812 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:47,814 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 81 treesize of output 78 [2018-11-09 21:54:47,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:47,817 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:47,817 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:47,819 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 29 treesize of output 45 [2018-11-09 21:54:47,819 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:47,830 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:47,833 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 81 treesize of output 78 [2018-11-09 21:54:47,835 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:47,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:47,836 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:47,836 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:47,838 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 29 treesize of output 63 [2018-11-09 21:54:47,838 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:47,852 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:47,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 112 [2018-11-09 21:54:47,874 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 91 treesize of output 104 [2018-11-09 21:54:47,875 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-09 21:54:47,925 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:47,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 109 [2018-11-09 21:54:47,937 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-11-09 21:54:47,997 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-09 21:54:47,999 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 71 treesize of output 64 [2018-11-09 21:54:48,001 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:48,002 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:48,002 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:48,002 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:48,004 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 25 treesize of output 51 [2018-11-09 21:54:48,004 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:48,017 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:48,020 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 73 treesize of output 72 [2018-11-09 21:54:48,023 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:48,024 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:48,030 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 2 case distinctions, treesize of input 31 treesize of output 77 [2018-11-09 21:54:48,031 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-09 21:54:48,054 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:54:48,056 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 65 treesize of output 64 [2018-11-09 21:54:48,058 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:54:48,059 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 21 [2018-11-09 21:54:48,059 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:48,068 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:48,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 10 xjuncts. [2018-11-09 21:54:48,219 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 11 variables, input treesize:174, output treesize:385 [2018-11-09 21:54:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-09 21:54:48,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:54:48,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 39 [2018-11-09 21:54:48,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-09 21:54:48,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-09 21:54:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1273, Unknown=3, NotChecked=72, Total=1482 [2018-11-09 21:54:48,692 INFO L87 Difference]: Start difference. First operand 292 states and 344 transitions. Second operand 39 states. [2018-11-09 21:54:51,471 WARN L179 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 51 [2018-11-09 21:54:52,534 WARN L179 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2018-11-09 21:54:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:54:53,967 INFO L93 Difference]: Finished difference Result 334 states and 391 transitions. [2018-11-09 21:54:53,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-09 21:54:53,967 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 88 [2018-11-09 21:54:53,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:54:53,968 INFO L225 Difference]: With dead ends: 334 [2018-11-09 21:54:53,968 INFO L226 Difference]: Without dead ends: 310 [2018-11-09 21:54:53,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=563, Invalid=4811, Unknown=32, NotChecked=144, Total=5550 [2018-11-09 21:54:53,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-09 21:54:54,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 290. [2018-11-09 21:54:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-11-09 21:54:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 340 transitions. [2018-11-09 21:54:54,035 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 340 transitions. Word has length 88 [2018-11-09 21:54:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:54:54,035 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 340 transitions. [2018-11-09 21:54:54,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-09 21:54:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 340 transitions. [2018-11-09 21:54:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-09 21:54:54,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:54:54,036 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 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-11-09 21:54:54,036 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:54:54,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:54:54,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1107878705, now seen corresponding path program 1 times [2018-11-09 21:54:54,037 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:54:54,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:54:54,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:54:54,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:54:54,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:54:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:54:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-09 21:54:54,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:54:54,501 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 21:54:54,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:54:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:54:54,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:54:54,550 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-11-09 21:54:54,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-09 21:54:54,606 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 12 treesize of output 11 [2018-11-09 21:54:54,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-11-09 21:54:54,669 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:54,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:54,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:54:54,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-09 21:54:54,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2018-11-09 21:54:54,713 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 13 treesize of output 10 [2018-11-09 21:54:54,715 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-11-09 21:54:54,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,725 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 13 treesize of output 10 [2018-11-09 21:54:54,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 10 treesize of output 9 [2018-11-09 21:54:54,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,735 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-11-09 21:54:54,761 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 21 treesize of output 22 [2018-11-09 21:54:54,763 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-11-09 21:54:54,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,777 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 21 treesize of output 22 [2018-11-09 21:54:54,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, 2 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-11-09 21:54:54,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:54,788 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:56 [2018-11-09 21:54:55,640 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-09 21:54:55,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-09 21:54:55,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:54:55,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 12 variables, input treesize:247, output treesize:1 [2018-11-09 21:54:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-09 21:54:55,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:54:55,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 37 [2018-11-09 21:54:55,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-09 21:54:55,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-09 21:54:55,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1213, Unknown=6, NotChecked=0, Total=1332 [2018-11-09 21:54:55,691 INFO L87 Difference]: Start difference. First operand 290 states and 340 transitions. Second operand 37 states. [2018-11-09 21:55:09,721 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 103 [2018-11-09 21:55:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:55:10,538 INFO L93 Difference]: Finished difference Result 355 states and 406 transitions. [2018-11-09 21:55:10,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-09 21:55:10,538 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 99 [2018-11-09 21:55:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:55:10,539 INFO L225 Difference]: With dead ends: 355 [2018-11-09 21:55:10,539 INFO L226 Difference]: Without dead ends: 174 [2018-11-09 21:55:10,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=570, Invalid=3839, Unknown=13, NotChecked=0, Total=4422 [2018-11-09 21:55:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-09 21:55:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 159. [2018-11-09 21:55:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-09 21:55:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 176 transitions. [2018-11-09 21:55:10,571 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 176 transitions. Word has length 99 [2018-11-09 21:55:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:55:10,571 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 176 transitions. [2018-11-09 21:55:10,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-09 21:55:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 176 transitions. [2018-11-09 21:55:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-09 21:55:10,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:55:10,572 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 21:55:10,572 INFO L424 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:55:10,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:55:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2095719340, now seen corresponding path program 2 times [2018-11-09 21:55:10,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:55:10,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:55:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:55:10,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 21:55:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:55:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:55:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-09 21:55:10,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 21:55:10,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-09 21:55:10,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-09 21:55:10,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-09 21:55:10,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-09 21:55:10,622 INFO L87 Difference]: Start difference. First operand 159 states and 176 transitions. Second operand 7 states. [2018-11-09 21:55:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:55:10,709 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2018-11-09 21:55:10,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-09 21:55:10,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-09 21:55:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:55:10,710 INFO L225 Difference]: With dead ends: 169 [2018-11-09 21:55:10,711 INFO L226 Difference]: Without dead ends: 159 [2018-11-09 21:55:10,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-09 21:55:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-09 21:55:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-11-09 21:55:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-09 21:55:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 175 transitions. [2018-11-09 21:55:10,756 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 175 transitions. Word has length 92 [2018-11-09 21:55:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:55:10,756 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 175 transitions. [2018-11-09 21:55:10,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-09 21:55:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 175 transitions. [2018-11-09 21:55:10,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-09 21:55:10,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 21:55:10,757 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 21:55:10,757 INFO L424 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 21:55:10,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 21:55:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1291100524, now seen corresponding path program 3 times [2018-11-09 21:55:10,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 21:55:10,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 21:55:10,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:55:10,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 21:55:10,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 21:55:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 21:55:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-09 21:55:11,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-09 21:55:11,230 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-09 21:55:11,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-09 21:55:11,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-09 21:55:11,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-09 21:55:11,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 21:55:11,317 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-11-09 21:55:11,318 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-11-09 21:55:11,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,328 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-11-09 21:55:11,329 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-11-09 21:55:11,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,337 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-11-09 21:55:11,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:55:11,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:55:11,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-09 21:55:11,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-09 21:55:11,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:55:11,385 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:55:11,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-11-09 21:55:11,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-11-09 21:55:11,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-11-09 21:55:11,442 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 29 treesize of output 28 [2018-11-09 21:55:11,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:55:11,461 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:55:11,463 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 24 treesize of output 34 [2018-11-09 21:55:11,463 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:55:11,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-11-09 21:55:11,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-09 21:55:11,508 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:55:11,509 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 24 treesize of output 34 [2018-11-09 21:55:11,509 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,524 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 25 treesize of output 24 [2018-11-09 21:55:11,524 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,531 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:55:11,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:55:11,545 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:61, output treesize:103 [2018-11-09 21:55:12,197 WARN L854 $PredicateComparison]: unable to prove that (exists ((|remove_#t~mem8.offset| Int) (|remove_#t~mem7.offset| Int) (|remove_#t~mem8.base| Int)) (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_remove_#in~x.base|) |c_remove_#in~x.offset|)) (.cse1 (+ |remove_#t~mem7.offset| 4))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 |remove_#t~mem8.base|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 |remove_#t~mem8.offset|)))))) is different from true [2018-11-09 21:55:12,200 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:55:12,205 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 55 [2018-11-09 21:55:12,213 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 20 treesize of output 31 [2018-11-09 21:55:12,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-09 21:55:12,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:55:12,250 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:55:12,254 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2018-11-09 21:55:12,256 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:55:12,257 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 36 treesize of output 31 [2018-11-09 21:55:12,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:55:12,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:55:12,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-09 21:55:12,277 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2018-11-09 21:55:12,285 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 36 treesize of output 39 [2018-11-09 21:55:12,286 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-09 21:55:12,307 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:55:12,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-09 21:55:12,340 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:99, output treesize:105 [2018-11-09 21:55:12,735 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 67 treesize of output 64 [2018-11-09 21:55:12,738 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 14 treesize of output 13 [2018-11-09 21:55:12,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-09 21:55:12,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:55:12,772 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 55 treesize of output 56 [2018-11-09 21:55:12,775 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-11-09 21:55:12,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-09 21:55:12,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:55:12,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-09 21:55:12,801 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:73 [2018-11-09 21:55:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-09 21:55:13,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-09 21:55:13,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 29] total 48 [2018-11-09 21:55:13,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-09 21:55:13,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-09 21:55:13,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1958, Unknown=14, NotChecked=90, Total=2256 [2018-11-09 21:55:13,497 INFO L87 Difference]: Start difference. First operand 159 states and 175 transitions. Second operand 48 states. [2018-11-09 21:55:16,765 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 81 [2018-11-09 21:55:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 21:55:16,926 INFO L93 Difference]: Finished difference Result 219 states and 237 transitions. [2018-11-09 21:55:16,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-09 21:55:16,926 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-11-09 21:55:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 21:55:16,927 INFO L225 Difference]: With dead ends: 219 [2018-11-09 21:55:16,927 INFO L226 Difference]: Without dead ends: 0 [2018-11-09 21:55:16,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 70 SyntacticMatches, 12 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2472 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=813, Invalid=6622, Unknown=51, NotChecked=170, Total=7656 [2018-11-09 21:55:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-09 21:55:16,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-09 21:55:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-09 21:55:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-09 21:55:16,928 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2018-11-09 21:55:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 21:55:16,929 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 21:55:16,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-09 21:55:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-09 21:55:16,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-09 21:55:16,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-09 21:55:17,064 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 214 [2018-11-09 21:55:17,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 21:55:17,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 21:55:17,342 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 541 DAG size of output: 493 [2018-11-09 21:55:17,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 21:55:17,475 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 486 DAG size of output: 461 [2018-11-09 21:55:17,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 21:55:17,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 21:55:17,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 21:55:17,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 21:55:17,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 21:55:17,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 21:55:17,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 21:55:17,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-09 21:55:17,750 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 230 [2018-11-09 21:55:17,988 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 563 DAG size of output: 510 [2018-11-09 21:55:18,567 WARN L179 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 130 [2018-11-09 21:55:18,700 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 70 [2018-11-09 21:55:21,838 WARN L179 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 1161 DAG size of output: 160 [2018-11-09 21:56:02,939 WARN L179 SmtUtils]: Spent 41.09 s on a formula simplification. DAG size of input: 1074 DAG size of output: 1 [2018-11-09 21:56:03,816 WARN L179 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 485 DAG size of output: 117 [2018-11-09 21:56:04,363 WARN L179 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 454 DAG size of output: 71 [2018-11-09 21:56:04,546 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 101 [2018-11-09 22:00:10,028 WARN L179 SmtUtils]: Spent 4.09 m on a formula simplification. DAG size of input: 1074 DAG size of output: 288 [2018-11-09 22:00:10,660 WARN L179 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 143 [2018-11-09 22:00:10,923 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 1 [2018-11-09 22:00:12,264 WARN L179 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 507 DAG size of output: 160 [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point L576(lines 576 577) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point L577-1(line 577) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point L575(line 575) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point L577-2(line 577) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point L576-2(lines 572 578) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point L574-1(lines 574 575) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point L575-2(line 575) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point L574-3(lines 574 575) no Hoare annotation was computed. [2018-11-09 22:00:12,266 INFO L421 ceAbstractionStarter]: At program point re_insertENTRY(lines 572 578) the Hoare annotation is: (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-09 22:00:12,266 INFO L425 ceAbstractionStarter]: For program point re_insertEXIT(lines 572 578) no Hoare annotation was computed. [2018-11-09 22:00:12,267 INFO L425 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 71 75) no Hoare annotation was computed. [2018-11-09 22:00:12,267 INFO L425 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 71 75) no Hoare annotation was computed. [2018-11-09 22:00:12,267 INFO L425 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 71 75) no Hoare annotation was computed. [2018-11-09 22:00:12,267 INFO L425 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 76 80) no Hoare annotation was computed. [2018-11-09 22:00:12,267 INFO L425 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 76 80) no Hoare annotation was computed. [2018-11-09 22:00:12,267 INFO L425 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 76 80) no Hoare annotation was computed. [2018-11-09 22:00:12,267 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-09 22:00:12,267 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-09 22:00:12,267 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-09 22:00:12,267 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-09 22:00:12,267 INFO L421 ceAbstractionStarter]: At program point L605(line 605) the Hoare annotation is: (let ((.cse1 (= (select |#valid| |main_~#list~0.base|) 1)) (.cse3 (= |main_~#list~0.offset| 0))) (or (let ((.cse0 (select |#memory_$Pointer$.base| |main_~#list~0.base|))) (let ((.cse4 (select .cse0 4)) (.cse2 (select |#memory_$Pointer$.base| main_~n~0.base))) (and (and (= (select |#valid| |main_#t~malloc17.base|) 1) (and (and (not (= (select .cse0 (+ |main_~#list~0.offset| 4)) 0)) .cse1 (not (= |main_~#list~0.base| |main_#t~malloc17.base|))) (and (= 0 main_~n~0.offset) (= 0 (select .cse2 (+ main_~n~0.offset 4))) (not (= |main_~#list~0.base| 0)) (= |main_~#list~0.base| (select .cse2 main_~n~0.offset)) .cse3)) (not (= 0 |main_#t~malloc17.base|))) (= 1 (select |#valid| main_~x~0.base)) (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) 4) main_~n~0.offset) (= .cse4 main_~x~0.base) (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) |main_~#list~0.offset|) 0) (= main_~x~0.offset 0) (= 0 main_~tail~0.offset) (= .cse4 main_~n~0.base) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= 0 |main_#t~malloc17.offset|) (= main_~tail~0.base (select .cse2 |main_~#list~0.offset|))))) (and (= main_~tail~0.base |main_~#list~0.base|) (not (= 0 main_~tail~0.base)) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.base |main_~#list~0.base|) .cse1 .cse3))) [2018-11-09 22:00:12,267 INFO L425 ceAbstractionStarter]: For program point L605-1(line 605) no Hoare annotation was computed. [2018-11-09 22:00:12,267 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 587 610) no Hoare annotation was computed. [2018-11-09 22:00:12,268 INFO L421 ceAbstractionStarter]: At program point L601-1(lines 593 603) the Hoare annotation is: (let ((.cse31 (select |#memory_$Pointer$.base| main_~n~0.base)) (.cse18 (select |#memory_$Pointer$.base| |main_~#list~0.base|)) (.cse39 (+ main_~n~0.offset 4))) (let ((.cse11 (select |#valid| |main_~#list~0.base|)) (.cse25 (select |#memory_$Pointer$.offset| main_~x~0.base)) (.cse12 (select |#memory_$Pointer$.base| main_~x~0.base)) (.cse13 (+ |main_~#list~0.offset| 4)) (.cse32 (= main_~n~0.base (select .cse18 .cse39))) (.cse34 (= 0 main_~n~0.offset)) (.cse38 (= |main_~#list~0.offset| main_~tail~0.offset)) (.cse21 (select .cse31 main_~n~0.offset)) (.cse29 (= 0 (select .cse31 .cse39))) (.cse22 (+ main_~tail~0.offset 4))) (let ((.cse0 (not (= |main_~#list~0.base| |main_#t~malloc17.base|))) (.cse2 (= (select |#valid| |main_#t~malloc17.base|) 1)) (.cse3 (not (= 0 |main_#t~malloc17.base|))) (.cse1 (not (= 0 main_~n~0.base))) (.cse14 (select |#valid| main_~x~0.base)) (.cse16 (let ((.cse41 (not (= 0 |main_~#list~0.base|))) (.cse42 (= |main_~#list~0.base| main_~tail~0.base))) (or (let ((.cse40 (select .cse18 main_~n~0.offset))) (and (= main_~tail~0.base .cse40) .cse34 .cse41 .cse42 .cse38 .cse32 (= main_~n~0.base .cse40))) (and .cse34 .cse41 .cse42 .cse38 (= main_~tail~0.base .cse21) .cse29 (= main_~n~0.base (select .cse18 .cse22)))))) (.cse23 (= |main_#t~malloc17.offset| 0)) (.cse24 (select |#memory_$Pointer$.offset| main_~n~0.base)) (.cse15 (or (and (= 0 (select .cse25 .cse13)) (= 0 (select .cse12 .cse13)) (not (= main_~x~0.base |main_#t~malloc17.base|)) (= 0 main_~x~0.offset)) (and (= main_~x~0.base |main_~#list~0.base|) (= |main_~#list~0.offset| main_~x~0.offset)))) (.cse20 (= 1 .cse11)) (.cse17 (= |main_~#list~0.offset| 0))) (or (and (and .cse0 .cse1 .cse2 (= 1 (select |#valid| main_~n~0.base)) .cse3 (exists ((main_~n~0.offset Int) (main_~n~0.base Int)) (let ((.cse4 (select |#memory_$Pointer$.offset| main_~n~0.base))) (let ((.cse7 (select .cse4 main_~n~0.offset)) (.cse10 (select |#memory_$Pointer$.base| main_~x~0.base))) (let ((.cse8 (select .cse10 main_~x~0.offset)) (.cse9 (select |#memory_$Pointer$.base| main_~n~0.base)) (.cse5 (+ main_~n~0.offset 4)) (.cse6 (+ .cse7 4))) (and (= 0 (select .cse4 .cse5)) (= main_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) .cse6)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) .cse7) (= (select (select |#memory_$Pointer$.offset| .cse8) .cse6) main_~n~0.offset) (= .cse8 (select .cse9 main_~n~0.offset)) (= 0 (select .cse9 .cse5)) (= 0 .cse7) (not (= (select .cse10 .cse6) main_~x~0.base)) (not (= main_~n~0.base main_~x~0.base))))))) (= .cse11 1) (= 0 (select (select |#memory_$Pointer$.offset| (select .cse12 main_~x~0.offset)) .cse13)) (= .cse14 1) .cse15 (= 0 |main_#t~malloc17.offset|) .cse16) .cse17) (let ((.cse19 (+ main_~x~0.offset 4))) (and .cse0 (= (select .cse18 .cse19) main_~x~0.base) .cse20 (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| .cse21) .cse22)) .cse2 .cse3 .cse23 .cse1 (= 1 .cse14) (= 0 main_~tail~0.offset) (= (select .cse24 main_~n~0.offset) main_~tail~0.offset) (and (= main_~x~0.offset 0) (= (select .cse25 .cse19) 0)) .cse16)) (and (and (and (not (= 0 main_~tail~0.base)) (let ((.cse26 (= 0 (select .cse24 .cse39)))) (let ((.cse33 (let ((.cse36 (and .cse38 (= main_~tail~0.base |main_~#list~0.base|))) (.cse37 (= |main_~#list~0.base| main_~x~0.base))) (or (and (and .cse34 .cse26 .cse29 (exists ((main_~tail~0.offset Int)) (let ((.cse35 (+ main_~tail~0.offset 4))) (and (= main_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) .cse35)) (= (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) .cse35) main_~n~0.offset))))) .cse36 .cse37 (or (not (= 0 .cse21)) (= main_~n~0.base main_~tail~0.base)) .cse23) (and (not (= 0 main_~x~0.base)) .cse36 .cse37))))) (or (and (let ((.cse27 (= (select .cse24 |main_~#list~0.offset|) 0)) (.cse28 (= |main_~#list~0.offset| main_~n~0.offset))) (or (let ((.cse30 (select .cse31 |main_~#list~0.offset|))) (and .cse26 (= (select .cse18 4) main_~n~0.base) .cse27 .cse28 .cse29 (= |main_~#list~0.base| .cse30) (= main_~n~0.offset (select (select |#memory_$Pointer$.offset| .cse30) 4)))) (and (= |main_~#list~0.base| main_~n~0.base) .cse26 .cse27 .cse28 .cse32 (= |main_~#list~0.base| (select .cse18 |main_~#list~0.offset|))))) (= |main_~#list~0.offset| |main_#t~malloc17.offset|) .cse33) (and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) .cse13)) .cse33 (= 0 (select .cse18 .cse13))))))) .cse15 .cse20) .cse17))))) [2018-11-09 22:00:12,268 INFO L425 ceAbstractionStarter]: For program point L593-1(lines 593 603) no Hoare annotation was computed. [2018-11-09 22:00:12,268 INFO L421 ceAbstractionStarter]: At program point L593-3(lines 593 603) the Hoare annotation is: (let ((.cse14 (select |#memory_$Pointer$.base| |main_~#list~0.base|)) (.cse27 (+ main_~n~0.offset 4))) (let ((.cse22 (= main_~n~0.base (select .cse14 .cse27))) (.cse2 (= |main_~#list~0.offset| 0)) (.cse26 (select |#memory_$Pointer$.base| main_~n~0.base)) (.cse18 (select |#memory_$Pointer$.base| main_~x~0.base))) (let ((.cse3 (= (select |#valid| |main_#t~malloc17.base|) 1)) (.cse4 (= 1 (select |#valid| main_~n~0.base))) (.cse1 (= (select |#valid| |main_~#list~0.base|) 1)) (.cse13 (not (= |main_~#list~0.base| |main_#t~malloc17.base|))) (.cse5 (not (= 0 |main_#t~malloc17.base|))) (.cse0 (= main_~x~0.offset |main_~#list~0.offset|)) (.cse15 (select |#memory_$Pointer$.offset| (select .cse18 main_~x~0.offset))) (.cse17 (select |#memory_$Pointer$.offset| main_~x~0.base)) (.cse19 (= 0 |main_#t~malloc17.offset|)) (.cse20 (= main_~tail~0.base (select .cse26 |main_~#list~0.offset|))) (.cse21 (let ((.cse24 (= 0 main_~n~0.offset)) (.cse25 (not (= |main_~#list~0.base| 0)))) (or (and (= |main_~#list~0.base| main_~n~0.base) .cse24 .cse25 .cse22 (= main_~n~0.base (select .cse14 main_~n~0.offset)) .cse2) (and .cse24 (exists ((main_~tail~0.offset Int)) (= main_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) (+ main_~tail~0.offset 4)))) (= 0 (select .cse26 .cse27)) .cse25 (= |main_~#list~0.base| (select .cse26 main_~n~0.offset)) .cse2))))) (or (and (= main_~tail~0.base |main_~#list~0.base|) (not (= 0 main_~tail~0.base)) .cse0 (= main_~x~0.base |main_~#list~0.base|) .cse1 .cse2) (let ((.cse16 (+ |main_~#list~0.offset| 4))) (and .cse3 .cse4 .cse5 (exists ((main_~n~0.offset Int) (main_~n~0.base Int)) (let ((.cse6 (select |#memory_$Pointer$.offset| main_~n~0.base))) (let ((.cse9 (select .cse6 main_~n~0.offset)) (.cse12 (select |#memory_$Pointer$.base| main_~x~0.base))) (let ((.cse10 (select .cse12 main_~x~0.offset)) (.cse11 (select |#memory_$Pointer$.base| main_~n~0.base)) (.cse7 (+ main_~n~0.offset 4)) (.cse8 (+ .cse9 4))) (and (= 0 (select .cse6 .cse7)) (= main_~n~0.base (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) .cse8)) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) .cse9) (= (select (select |#memory_$Pointer$.offset| .cse10) .cse8) main_~n~0.offset) (= .cse10 (select .cse11 main_~n~0.offset)) (= 0 (select .cse11 .cse7)) (= 0 .cse9) (not (= (select .cse12 .cse8) main_~x~0.base)) (not (= main_~n~0.base main_~x~0.base))))))) .cse13 .cse1 (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) main_~n~0.offset) main_~tail~0.offset) (and (not (= 0 main_~n~0.base)) (= (select .cse14 4) main_~n~0.base)) (= 0 (select .cse15 .cse16)) (= (select |#valid| main_~x~0.base) 1) (and (= 0 (select .cse17 .cse16)) (= 0 (select .cse18 .cse16)) (not (= main_~x~0.base |main_#t~malloc17.base|)) (= 0 main_~x~0.offset)) .cse19 .cse20 .cse21)) (and (and .cse3 .cse4 (and .cse1 .cse13)) .cse22 .cse5 .cse0 (= 0 main_~tail~0.offset) (let ((.cse23 (+ main_~tail~0.offset 4))) (and (not (= 0 main_~x~0.base)) (= main_~x~0.base (select .cse14 .cse23)) (= (select .cse17 main_~x~0.offset) main_~tail~0.offset) (= main_~x~0.offset (select .cse15 .cse23)))) (= (select .cse17 (+ main_~x~0.offset 4)) 0) .cse19 .cse20 .cse21))))) [2018-11-09 22:00:12,268 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-09 22:00:12,268 INFO L425 ceAbstractionStarter]: For program point L589-1(line 589) no Hoare annotation was computed. [2018-11-09 22:00:12,268 INFO L425 ceAbstractionStarter]: For program point L589-2(line 589) no Hoare annotation was computed. [2018-11-09 22:00:12,268 INFO L425 ceAbstractionStarter]: For program point L606(line 606) no Hoare annotation was computed. [2018-11-09 22:00:12,268 INFO L421 ceAbstractionStarter]: At program point L606-2(line 606) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| main_~x~0.base)) (.cse1 (select |#memory_$Pointer$.offset| main_~n~0.base)) (.cse3 (select |#memory_$Pointer$.base| main_~x~0.base)) (.cse2 (+ main_~n~0.offset 4)) (.cse12 (select |#memory_$Pointer$.base| main_~n~0.base))) (and (= main_~x~0.offset (select .cse0 (+ main_~x~0.offset 4))) (not (= |main_~#list~0.base| |main_#t~malloc17.base|)) (= (select .cse0 main_~x~0.offset) 0) (= 0 (select .cse1 .cse2)) (not (= (select .cse3 |main_~#list~0.offset|) main_~x~0.base)) (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse10 (select |#memory_$Pointer$.offset| v_prenex_17))) (let ((.cse8 (select .cse10 v_prenex_18)) (.cse5 (select |#memory_$Pointer$.base| v_prenex_17)) (.cse11 (+ v_prenex_18 4))) (let ((.cse4 (select .cse5 .cse11)) (.cse7 (select .cse5 v_prenex_18)) (.cse6 (+ .cse8 4)) (.cse9 (select .cse10 .cse11))) (and (= .cse4 0) (not (= (select .cse5 |main_~#list~0.offset|) v_prenex_17)) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) .cse6) .cse4) (= |main_~#list~0.base| .cse7) (= .cse8 0) (= v_prenex_18 .cse9) (= .cse9 (select (select |#memory_$Pointer$.offset| .cse7) .cse6)) (= .cse9 0) (not (= |main_~#list~0.base| v_prenex_17))))))) (= (select |#valid| |main_#t~malloc17.base|) 1) (= 1 (select |#valid| main_~n~0.base)) (not (= 0 |main_#t~malloc17.base|)) (= 0 main_~n~0.offset) (not (= 0 main_~n~0.base)) (= 1 (select |#valid| main_~x~0.base)) (not (= 0 main_~x~0.base)) (= main_~x~0.offset |main_~#list~0.offset|) (= main_~x~0.offset 0) (= 0 main_~tail~0.offset) (= (select |#valid| |main_~#list~0.base|) 1) (= (select .cse1 main_~n~0.offset) main_~tail~0.offset) (= (select .cse12 main_~n~0.offset) |main_~#list~0.base|) (= |main_~#list~0.base| (select .cse3 0)) (= (select .cse3 4) 0) (not (= main_~tail~0.base main_~n~0.base)) (not (= (select .cse3 main_~x~0.offset) 0)) (= 0 (select .cse12 .cse2)) (not |main_#t~short21|) (= 0 |main_#t~malloc17.offset|) (= main_~tail~0.base (select .cse12 |main_~#list~0.offset|)))) [2018-11-09 22:00:12,268 INFO L425 ceAbstractionStarter]: For program point L606-3(line 606) no Hoare annotation was computed. [2018-11-09 22:00:12,269 INFO L421 ceAbstractionStarter]: At program point L606-4(line 606) the Hoare annotation is: (let ((.cse29 (= main_~tail~0.base |main_~#list~0.base|)) (.cse31 (not (= 0 main_~tail~0.base))) (.cse27 (= main_~x~0.base |main_~#list~0.base|)) (.cse32 (= (select |#valid| |main_~#list~0.base|) 1))) (or (let ((.cse6 (select |#memory_$Pointer$.base| main_~x~0.base))) (let ((.cse2 (+ main_~n~0.offset 4)) (.cse5 (+ main_~x~0.offset 4)) (.cse1 (select |#memory_$Pointer$.offset| main_~n~0.base)) (.cse0 (select .cse6 main_~x~0.offset)) (.cse4 (select |#memory_$Pointer$.offset| main_~x~0.base)) (.cse3 (select |#memory_$Pointer$.base| main_~n~0.base))) (and (= |main_~#list~0.base| .cse0) (= 0 (select .cse1 .cse2)) (= 0 (select .cse3 .cse2)) (= (select .cse4 .cse5) 0) (and (= 0 (select .cse6 (+ |main_~#list~0.offset| 4))) (let ((.cse14 (not (= 0 main_~n~0.base))) (.cse23 (and (= |main_~#list~0.offset| |main_#t~malloc17.offset|) (= 1 (select |#valid| main_~x~0.base)) (let ((.cse28 (= 0 main_~n~0.offset)) (.cse30 (= |main_~#list~0.offset| main_~tail~0.offset))) (or (and .cse28 .cse29 .cse30 .cse31 .cse32) (and (not (= |main_~#list~0.base| main_~x~0.base)) .cse28 .cse29 .cse30 (not (= |main_~#list~0.base| main_~n~0.base)) .cse32))) (= (select |#valid| |main_#t~malloc17.base|) 1) (= 1 (select |#valid| main_~n~0.base))))) (let ((.cse9 (= (select .cse4 main_~x~0.offset) 0)) (.cse11 (or (not (= main_~tail~0.base main_~n~0.base)) (and .cse27 (= |main_~#list~0.offset| main_~x~0.offset)))) (.cse10 (not (= 0 .cse0))) (.cse8 (and .cse14 .cse23 |main_#t~short21|)) (.cse7 (not (= 0 main_~x~0.base))) (.cse12 (select .cse1 main_~n~0.offset)) (.cse13 (not (= 0 |main_#t~malloc17.base|)))) (or (and .cse7 .cse8 (not (= |main_~#list~0.base| |main_#t~malloc17.base|)) .cse9 .cse10 .cse11 (= 0 .cse12) .cse13) (and .cse9 (and .cse11 (or (and .cse14 (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse21 (select |#memory_$Pointer$.offset| v_prenex_17))) (let ((.cse19 (select .cse21 v_prenex_18)) (.cse16 (select |#memory_$Pointer$.base| v_prenex_17)) (.cse22 (+ v_prenex_18 4))) (let ((.cse15 (select .cse16 .cse22)) (.cse18 (select .cse16 v_prenex_18)) (.cse17 (+ .cse19 4)) (.cse20 (select .cse21 .cse22))) (and (= .cse15 0) (not (= (select .cse16 |main_~#list~0.offset|) v_prenex_17)) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) .cse17) .cse15) (= |main_~#list~0.base| .cse18) (= .cse19 0) (= v_prenex_18 .cse20) (= .cse20 (select (select |#memory_$Pointer$.offset| .cse18) .cse17)) (= .cse20 0) (not (= |main_~#list~0.base| v_prenex_17))))))) (not (= .cse0 0)) .cse23 |main_#t~short21| (= |main_#t~ret20| 0)) (and .cse10 (let ((.cse25 (select |#memory_$Pointer$.base| |main_~#list~0.base|))) (let ((.cse24 (= (select .cse6 .cse5) (select .cse25 .cse5)))) (or (and .cse24 (= (select .cse25 (+ main_~x~0.offset 8)) 0)) (and (exists ((main_~n~0.offset Int) (main_~n~0.base Int)) (let ((.cse26 (select |#memory_$Pointer$.base| main_~n~0.base))) (and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select .cse26 main_~n~0.offset)) (= 0 (select .cse26 (+ main_~n~0.offset 4))) (not (= main_~n~0.base main_~x~0.base))))) .cse24)))) .cse8))) .cse7 (= .cse12 main_~tail~0.offset) .cse13)))) (= 0 main_~x~0.offset)) (= 0 |main_#t~malloc17.offset|) (= main_~tail~0.base (select .cse3 |main_~#list~0.offset|))))) (and .cse29 .cse31 (= main_~x~0.offset |main_~#list~0.offset|) .cse27 |main_#t~short21| .cse32 (= |main_~#list~0.offset| 0)))) [2018-11-09 22:00:12,269 INFO L425 ceAbstractionStarter]: For program point L606-5(line 606) no Hoare annotation was computed. [2018-11-09 22:00:12,269 INFO L425 ceAbstractionStarter]: For program point L598(line 598) no Hoare annotation was computed. [2018-11-09 22:00:12,269 INFO L425 ceAbstractionStarter]: For program point L598-1(line 598) no Hoare annotation was computed. [2018-11-09 22:00:12,269 INFO L425 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2018-11-09 22:00:12,269 INFO L421 ceAbstractionStarter]: At program point L607(line 607) the Hoare annotation is: (let ((.cse0 (= main_~tail~0.base |main_~#list~0.base|)) (.cse1 (not (= 0 main_~tail~0.base))) (.cse3 (= (select |#valid| |main_~#list~0.base|) 1)) (.cse4 (= |main_~#list~0.offset| 0)) (.cse2 (= main_~x~0.base |main_~#list~0.base|))) (or (and .cse0 .cse1 (= main_~x~0.offset |main_~#list~0.offset|) .cse2 .cse3 .cse4) (let ((.cse5 (select |#memory_$Pointer$.base| main_~x~0.base)) (.cse26 (select |#memory_$Pointer$.offset| main_~n~0.base)) (.cse28 (+ main_~n~0.offset 4)) (.cse27 (select |#memory_$Pointer$.offset| main_~x~0.base)) (.cse25 (+ main_~x~0.offset 4)) (.cse29 (select |#memory_$Pointer$.base| main_~n~0.base))) (and (= |main_~#list~0.base| (select .cse5 main_~x~0.offset)) (and (= 0 (select .cse5 (+ |main_~#list~0.offset| 4))) (let ((.cse9 (= (select .cse27 main_~x~0.offset) 0)) (.cse10 (or (not (= main_~tail~0.base main_~n~0.base)) (and .cse2 (= |main_~#list~0.offset| main_~x~0.offset)))) (.cse6 (not (= 0 main_~n~0.base))) (.cse8 (and (= |main_~#list~0.offset| |main_#t~malloc17.offset|) (= 1 (select |#valid| main_~x~0.base)) (and (= 0 main_~n~0.offset) .cse0 (= |main_~#list~0.offset| main_~tail~0.offset) .cse1 .cse3 .cse4) (= (select |#valid| |main_#t~malloc17.base|) 1) (= 1 (select |#valid| main_~n~0.base)))) (.cse7 (not (= 0 main_~x~0.base))) (.cse11 (select .cse26 main_~n~0.offset)) (.cse12 (not (= 0 |main_#t~malloc17.base|)))) (or (and .cse6 .cse7 .cse8 (not (= |main_~#list~0.base| |main_#t~malloc17.base|)) .cse9 .cse10 (= 0 .cse11) .cse12) (and .cse9 (and .cse10 (or (and .cse6 (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse19 (select |#memory_$Pointer$.offset| v_prenex_17))) (let ((.cse17 (select .cse19 v_prenex_18)) (.cse14 (select |#memory_$Pointer$.base| v_prenex_17)) (.cse20 (+ v_prenex_18 4))) (let ((.cse13 (select .cse14 .cse20)) (.cse16 (select .cse14 v_prenex_18)) (.cse15 (+ .cse17 4)) (.cse18 (select .cse19 .cse20))) (and (= .cse13 0) (not (= (select .cse14 |main_~#list~0.offset|) v_prenex_17)) (= (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) .cse15) .cse13) (= |main_~#list~0.base| .cse16) (= .cse17 0) (= v_prenex_18 .cse18) (= .cse18 (select (select |#memory_$Pointer$.offset| .cse16) .cse15)) (= .cse18 0) (not (= |main_~#list~0.base| v_prenex_17))))))) .cse7 .cse8) (and .cse6 .cse8 (let ((.cse24 (select .cse5 .cse25)) (.cse22 (select |#memory_$Pointer$.base| |main_~#list~0.base|))) (let ((.cse21 (= .cse24 (select .cse22 .cse25)))) (or (and .cse21 .cse7 (= (select .cse22 (+ main_~x~0.offset 8)) 0)) (and (exists ((main_~n~0.offset Int) (main_~n~0.base Int)) (let ((.cse23 (select |#memory_$Pointer$.base| main_~n~0.base))) (and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (select .cse23 main_~n~0.offset)) (= 0 (select .cse23 (+ main_~n~0.offset 4))) (not (= main_~n~0.base main_~x~0.base))))) .cse21 (not (= .cse24 main_~x~0.base))))))))) (= .cse11 main_~tail~0.offset) .cse12))) (= 0 main_~x~0.offset)) (= 0 (select .cse26 .cse28)) (= 0 (select .cse29 .cse28)) (= (select .cse27 .cse25) 0) (= main_~tail~0.base (select .cse29 |main_~#list~0.offset|)))))) [2018-11-09 22:00:12,269 INFO L421 ceAbstractionStarter]: At program point L607-1(line 607) the Hoare annotation is: (let ((.cse0 (= main_~tail~0.base |main_~#list~0.base|)) (.cse1 (not (= 0 main_~tail~0.base))) (.cse5 (= main_~x~0.offset |main_~#list~0.offset|)) (.cse2 (= (select |#valid| |main_~#list~0.base|) 1)) (.cse3 (= |main_~#list~0.offset| 0))) (or (let ((.cse4 (select (select |#memory_$Pointer$.base| |main_~#list~0.base|) 4))) (let ((.cse6 (select |#memory_$Pointer$.base| .cse4)) (.cse7 (select |#memory_$Pointer$.offset| main_~x~0.base))) (and (not (= 0 main_~n~0.base)) (and (not (= main_~tail~0.base main_~n~0.base)) (and (= 1 (select |#valid| main_~x~0.base)) (and (= 0 main_~n~0.offset) .cse0 .cse1 .cse2 .cse3) (= (select |#valid| |main_#t~malloc17.base|) 1) (= 1 (select |#valid| main_~n~0.base)))) (= .cse4 main_~x~0.base) .cse5 (= (select (select |#memory_$Pointer$.offset| main_~n~0.base) |main_~#list~0.offset|) main_~tail~0.offset) (= 0 main_~tail~0.offset) (= (select .cse6 4) 0) (= 0 (select .cse7 |main_~#list~0.offset|)) (not (= 0 .cse4)) (= (select .cse6 0) |main_~#list~0.base|) (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| |main_~#list~0.base|) 4)) (= (select .cse7 (+ main_~x~0.offset 4)) 0) (not (= 0 |main_#t~malloc17.base|)) (= 0 |main_#t~malloc17.offset|) (= main_~tail~0.base (select (select |#memory_$Pointer$.base| main_~n~0.base) |main_~#list~0.offset|))))) (and .cse0 .cse1 .cse5 (= main_~x~0.base |main_~#list~0.base|) .cse2 .cse3))) [2018-11-09 22:00:12,269 INFO L425 ceAbstractionStarter]: For program point L599(line 599) no Hoare annotation was computed. [2018-11-09 22:00:12,269 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-09 22:00:12,269 INFO L425 ceAbstractionStarter]: For program point L595-1(line 595) no Hoare annotation was computed. [2018-11-09 22:00:12,269 INFO L425 ceAbstractionStarter]: For program point L591(line 591) no Hoare annotation was computed. [2018-11-09 22:00:12,269 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 587 610) no Hoare annotation was computed. [2018-11-09 22:00:12,269 INFO L421 ceAbstractionStarter]: At program point L608(line 608) the Hoare annotation is: (and (= (select |#valid| |main_~#list~0.base|) 1) (= |main_#t~ret22| 1)) [2018-11-09 22:00:12,270 INFO L425 ceAbstractionStarter]: For program point L608-1(line 608) no Hoare annotation was computed. [2018-11-09 22:00:12,270 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 587 610) the Hoare annotation is: (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2018-11-09 22:00:12,270 INFO L425 ceAbstractionStarter]: For program point L604(line 604) no Hoare annotation was computed. [2018-11-09 22:00:12,270 INFO L425 ceAbstractionStarter]: For program point L600(lines 594 603) no Hoare annotation was computed. [2018-11-09 22:00:12,270 INFO L425 ceAbstractionStarter]: For program point L596(lines 596 597) no Hoare annotation was computed. [2018-11-09 22:00:12,270 INFO L425 ceAbstractionStarter]: For program point is_list_containing_xEXIT(lines 579 586) no Hoare annotation was computed. [2018-11-09 22:00:12,270 INFO L428 ceAbstractionStarter]: At program point is_list_containing_xENTRY(lines 579 586) the Hoare annotation is: true [2018-11-09 22:00:12,270 INFO L425 ceAbstractionStarter]: For program point L584(line 584) no Hoare annotation was computed. [2018-11-09 22:00:12,270 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-09 22:00:12,270 INFO L421 ceAbstractionStarter]: At program point L584-1(line 584) the Hoare annotation is: (let ((.cse44 (+ |is_list_containing_x_#in~l.offset| 4))) (let ((.cse43 (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) .cse44)) (.cse0 (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) .cse44))) (let ((.cse7 (or (not (= 0 .cse43)) (not (= .cse0 0)))) (.cse8 (= |is_list_containing_x_#t~mem14.offset| .cse43))) (and (or (not (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))) (= is_list_containing_x_~x.offset |is_list_containing_x_#in~x.offset|) (= .cse0 |is_list_containing_x_#t~mem14.base|) (or (and (forall ((|v_main_~#list~0.base_BEFORE_CALL_31| Int)) (let ((.cse1 (select |#memory_$Pointer$.base| |v_main_~#list~0.base_BEFORE_CALL_31|))) (let ((.cse2 (select .cse1 0))) (or (= 0 |v_main_~#list~0.base_BEFORE_CALL_31|) (not (= |v_main_~#list~0.base_BEFORE_CALL_31| (select .cse1 4))) (not (= 0 (select (select |#memory_$Pointer$.offset| .cse2) 4))) (not (= .cse2 |v_main_~#list~0.base_BEFORE_CALL_31|)))))) (forall ((v_prenex_134 Int) (v_prenex_135 Int)) (let ((.cse4 (select |#memory_$Pointer$.base| v_prenex_134)) (.cse5 (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_135) 4)))) (let ((.cse3 (select .cse5 0)) (.cse6 (select .cse4 0))) (or (not (= .cse3 v_prenex_135)) (= 0 v_prenex_135) (not (= 0 (select .cse4 4))) (not (= (select .cse5 4) 0)) (not (= .cse6 .cse3)) (not (= (select (select |#memory_$Pointer$.offset| .cse6) 4) 0))))))) (and .cse7 .cse8) (and (forall ((v_prenex_3 Int)) (let ((.cse11 (select |#memory_$Pointer$.base| v_prenex_3))) (let ((.cse9 (select |#memory_$Pointer$.offset| v_prenex_3)) (.cse10 (select .cse11 0))) (or (= v_prenex_3 0) (not (= 0 (select .cse9 0))) (not (= (select (select |#memory_$Pointer$.base| .cse10) 4) v_prenex_3)) (not (= (select .cse11 4) 0)) (not (= 0 (select .cse9 4))) (not (= 0 (select (select |#memory_$Pointer$.offset| .cse10) 4))))))) (forall ((v_main_~x~0.base_BEFORE_CALL_7 Int)) (let ((.cse13 (select |#memory_$Pointer$.offset| v_main_~x~0.base_BEFORE_CALL_7)) (.cse12 (select |#memory_$Pointer$.base| v_main_~x~0.base_BEFORE_CALL_7))) (or (not (= v_main_~x~0.base_BEFORE_CALL_7 (select .cse12 4))) (not (= (select .cse13 4) 0)) (= v_main_~x~0.base_BEFORE_CALL_7 0) (not (= (select .cse13 0) 0)) (not (= (select .cse12 0) v_main_~x~0.base_BEFORE_CALL_7)))))) (forall ((v_prenex_230 Int) (v_prenex_229 Int)) (let ((.cse15 (+ v_prenex_230 4))) (let ((.cse14 (select (select |#memory_$Pointer$.base| v_prenex_229) .cse15))) (or (not (= 0 (select (select |#memory_$Pointer$.offset| .cse14) 4))) (= v_prenex_229 .cse14) (not (= 0 (select (select |#memory_$Pointer$.offset| v_prenex_229) .cse15))) (not (= (select (select |#memory_$Pointer$.base| .cse14) 4) 0))))))) (or (and (or (forall ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse22 (select |#memory_$Pointer$.offset| v_prenex_17))) (let ((.cse20 (select .cse22 v_prenex_18)) (.cse21 (select |#memory_$Pointer$.base| v_prenex_17)) (.cse23 (+ v_prenex_18 4))) (let ((.cse16 (select .cse21 .cse23)) (.cse19 (select .cse22 .cse23)) (.cse18 (+ .cse20 4)) (.cse17 (select .cse21 v_prenex_18))) (or (not (= 0 .cse16)) (not (= .cse16 (select (select |#memory_$Pointer$.base| .cse17) .cse18))) (not (= .cse19 0)) (not (= .cse19 v_prenex_18)) (not (= .cse20 0)) (not (= .cse19 (select (select |#memory_$Pointer$.offset| .cse17) .cse18))) (= v_prenex_17 (select .cse21 0)) (= v_prenex_17 .cse17)))))) (forall ((|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_3| Int) (|v_is_list_containing_x_#in~l.base_BEFORE_CALL_3| Int)) (= 0 (select (select |#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_3|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_3| 4))))) (or (forall ((v_prenex_22 Int) (v_prenex_21 Int)) (let ((.cse30 (select |#memory_$Pointer$.offset| v_prenex_22))) (let ((.cse27 (select .cse30 v_prenex_21)) (.cse29 (select |#memory_$Pointer$.base| v_prenex_22)) (.cse31 (+ v_prenex_21 4))) (let ((.cse24 (select .cse29 .cse31)) (.cse25 (select .cse29 v_prenex_21)) (.cse26 (+ .cse27 4)) (.cse28 (select .cse30 .cse31))) (or (not (= .cse24 (select (select |#memory_$Pointer$.base| .cse25) .cse26))) (not (= 0 .cse27)) (not (= 0 .cse28)) (= (select .cse29 0) v_prenex_22) (= v_prenex_22 .cse25) (not (= .cse24 0)) (not (= v_prenex_21 .cse28)) (not (= (select (select |#memory_$Pointer$.offset| .cse25) .cse26) .cse28))))))) (forall ((v_prenex_23 Int) (v_prenex_24 Int)) (= 0 (select (select |#memory_$Pointer$.base| v_prenex_24) (+ v_prenex_23 4)))))) (forall ((v_main_~x~0.base_BEFORE_CALL_9 Int)) (let ((.cse34 (select |#memory_$Pointer$.base| v_main_~x~0.base_BEFORE_CALL_9))) (let ((.cse33 (select .cse34 4)) (.cse32 (select .cse34 0))) (or (not (= (select (select |#memory_$Pointer$.base| .cse32) 4) .cse33)) (not (= 0 .cse33)) (= v_main_~x~0.base_BEFORE_CALL_9 0) (= v_main_~x~0.base_BEFORE_CALL_9 .cse32))))) .cse7) (= is_list_containing_x_~l.offset |is_list_containing_x_#in~l.offset|) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (or (forall ((|v_main_~#list~0.base_BEFORE_CALL_41| Int)) (let ((.cse38 (select (select |#memory_$Pointer$.base| |v_main_~#list~0.base_BEFORE_CALL_41|) 4)) (.cse37 (select (select |#memory_$Pointer$.offset| |v_main_~#list~0.base_BEFORE_CALL_41|) 4))) (let ((.cse36 (+ .cse37 4)) (.cse39 (select |#memory_$Pointer$.offset| .cse38)) (.cse35 (select |#memory_$Pointer$.base| .cse38))) (or (not (= 0 (select .cse35 .cse36))) (not (= 0 .cse37)) (= |v_main_~#list~0.base_BEFORE_CALL_41| .cse38) (not (= (select .cse39 .cse36) 0)) (not (= (select .cse39 0) 0)) (not (= (select .cse35 0) |v_main_~#list~0.base_BEFORE_CALL_41|)))))) (forall ((|v_main_~#list~0.base_BEFORE_CALL_30| Int)) (let ((.cse41 (select (select |#memory_$Pointer$.base| |v_main_~#list~0.base_BEFORE_CALL_30|) 4))) (let ((.cse40 (select |#memory_$Pointer$.base| .cse41))) (or (not (= 0 (select .cse40 4))) (not (= |v_main_~#list~0.base_BEFORE_CALL_30| (select .cse40 0))) (= .cse41 0))))) (and .cse8 (let ((.cse42 (+ is_list_containing_x_~l.offset 4))) (or (not (= 0 (select (select |#memory_$Pointer$.base| is_list_containing_x_~l.base) .cse42))) (not (= is_list_containing_x_~l.offset 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| is_list_containing_x_~l.base) .cse42))))))) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|))))) [2018-11-09 22:00:12,270 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 584) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point L584-2(line 584) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point is_list_containing_xFINAL(lines 579 586) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 582) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 570) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point L570-2(line 570) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L421 ceAbstractionStarter]: At program point removeENTRY(lines 565 571) the Hoare annotation is: (and (or (forall ((v_main_~x~0.base_BEFORE_CALL_31 Int)) (let ((.cse1 (select |old(#memory_$Pointer$.offset)| v_main_~x~0.base_BEFORE_CALL_31)) (.cse0 (select |old(#memory_$Pointer$.base)| v_main_~x~0.base_BEFORE_CALL_31))) (or (= v_main_~x~0.base_BEFORE_CALL_31 0) (not (= (select .cse0 4) 0)) (not (= (select .cse1 0) 0)) (not (= (select .cse1 4) 0)) (= v_main_~x~0.base_BEFORE_CALL_31 (select .cse0 0))))) (forall ((|v_main_~#list~0.base_BEFORE_CALL_41| Int)) (let ((.cse5 (select (select |old(#memory_$Pointer$.base)| |v_main_~#list~0.base_BEFORE_CALL_41|) 4)) (.cse4 (select (select |old(#memory_$Pointer$.offset)| |v_main_~#list~0.base_BEFORE_CALL_41|) 4))) (let ((.cse3 (+ .cse4 4)) (.cse6 (select |old(#memory_$Pointer$.offset)| .cse5)) (.cse2 (select |old(#memory_$Pointer$.base)| .cse5))) (or (not (= 0 (select .cse2 .cse3))) (not (= 0 .cse4)) (= |v_main_~#list~0.base_BEFORE_CALL_41| .cse5) (not (= (select .cse6 .cse3) 0)) (not (= (select .cse6 0) 0)) (not (= (select .cse2 0) |v_main_~#list~0.base_BEFORE_CALL_41|)))))) (and (forall ((|v_main_~#list~0.base_BEFORE_CALL_31| Int)) (let ((.cse7 (select |old(#memory_$Pointer$.base)| |v_main_~#list~0.base_BEFORE_CALL_31|))) (let ((.cse8 (select .cse7 0))) (or (= 0 |v_main_~#list~0.base_BEFORE_CALL_31|) (not (= |v_main_~#list~0.base_BEFORE_CALL_31| (select .cse7 4))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| .cse8) 4))) (not (= .cse8 |v_main_~#list~0.base_BEFORE_CALL_31|)))))) (forall ((v_prenex_134 Int) (v_prenex_135 Int)) (let ((.cse10 (select |old(#memory_$Pointer$.base)| v_prenex_134)) (.cse11 (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| v_prenex_135) 4)))) (let ((.cse9 (select .cse11 0)) (.cse12 (select .cse10 0))) (or (not (= .cse9 v_prenex_135)) (= 0 v_prenex_135) (not (= 0 (select .cse10 4))) (not (= (select .cse11 4) 0)) (not (= .cse12 .cse9)) (not (= (select (select |old(#memory_$Pointer$.offset)| .cse12) 4) 0))))))) (forall ((|v_main_~#list~0.base_BEFORE_CALL_30| Int)) (let ((.cse14 (select (select |old(#memory_$Pointer$.base)| |v_main_~#list~0.base_BEFORE_CALL_30|) 4))) (let ((.cse13 (select |old(#memory_$Pointer$.base)| .cse14))) (or (not (= 0 (select .cse13 4))) (not (= |v_main_~#list~0.base_BEFORE_CALL_30| (select .cse13 0))) (= .cse14 0))))) (or (and (forall ((v_prenex_3 Int)) (let ((.cse17 (select |old(#memory_$Pointer$.base)| v_prenex_3))) (let ((.cse15 (select |old(#memory_$Pointer$.offset)| v_prenex_3)) (.cse16 (select .cse17 0))) (or (= v_prenex_3 0) (not (= 0 (select .cse15 0))) (not (= (select (select |old(#memory_$Pointer$.base)| .cse16) 4) v_prenex_3)) (not (= (select .cse17 4) 0)) (not (= 0 (select .cse15 4))) (not (= 0 (select (select |old(#memory_$Pointer$.offset)| .cse16) 4))))))) (forall ((v_main_~x~0.base_BEFORE_CALL_7 Int)) (let ((.cse19 (select |old(#memory_$Pointer$.offset)| v_main_~x~0.base_BEFORE_CALL_7)) (.cse18 (select |old(#memory_$Pointer$.base)| v_main_~x~0.base_BEFORE_CALL_7))) (or (not (= v_main_~x~0.base_BEFORE_CALL_7 (select .cse18 4))) (not (= (select .cse19 4) 0)) (= v_main_~x~0.base_BEFORE_CALL_7 0) (not (= (select .cse19 0) 0)) (not (= (select .cse18 0) v_main_~x~0.base_BEFORE_CALL_7)))))) (forall ((v_main_~x~0.base_BEFORE_CALL_19 Int)) (let ((.cse21 (select |old(#memory_$Pointer$.base)| v_main_~x~0.base_BEFORE_CALL_19))) (let ((.cse20 (select .cse21 0))) (or (= 0 .cse20) (= v_main_~x~0.base_BEFORE_CALL_19 .cse20) (not (= 0 (select .cse21 4)))))))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-11-09 22:00:12,271 INFO L425 ceAbstractionStarter]: For program point L568-1(line 568) no Hoare annotation was computed. [2018-11-09 22:00:12,272 INFO L425 ceAbstractionStarter]: For program point L570-3(line 570) no Hoare annotation was computed. [2018-11-09 22:00:12,272 INFO L425 ceAbstractionStarter]: For program point L569-2(lines 565 571) no Hoare annotation was computed. [2018-11-09 22:00:12,272 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 567 568) no Hoare annotation was computed. [2018-11-09 22:00:12,272 INFO L425 ceAbstractionStarter]: For program point L568-2(line 568) no Hoare annotation was computed. [2018-11-09 22:00:12,272 INFO L425 ceAbstractionStarter]: For program point L568-3(line 568) no Hoare annotation was computed. [2018-11-09 22:00:12,272 INFO L425 ceAbstractionStarter]: For program point L567-3(lines 567 568) no Hoare annotation was computed. [2018-11-09 22:00:12,272 INFO L425 ceAbstractionStarter]: For program point removeEXIT(lines 565 571) no Hoare annotation was computed. [2018-11-09 22:00:12,281 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,282 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,282 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,283 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,283 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,283 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,283 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,283 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,284 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,284 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,284 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,284 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,284 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,284 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,284 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,284 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,285 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,285 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,285 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,285 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,285 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,285 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,285 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,286 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,286 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,286 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,286 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,286 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,287 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,287 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,288 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,288 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,288 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,288 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,289 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,289 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,289 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,290 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,290 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,290 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,290 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,291 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,291 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,291 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,291 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,291 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,292 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,292 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,292 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,292 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,293 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,293 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,293 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,293 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,294 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,294 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,294 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,294 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,295 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,295 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,295 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,295 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,296 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,296 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,296 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,296 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,297 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,297 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,297 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,298 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,298 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,298 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,298 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,298 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,299 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,299 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,299 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,299 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,300 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,301 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,301 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,301 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,301 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,301 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,301 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,301 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,301 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,302 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,302 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,302 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,302 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,302 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,302 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,302 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,303 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,303 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,303 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,303 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,303 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,304 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,304 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,304 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,304 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,304 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,304 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,305 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,305 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,305 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,305 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,305 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,305 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,305 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,305 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,305 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,306 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,306 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,306 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,306 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,306 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,307 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,307 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,307 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,307 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,307 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,308 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,308 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,308 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,308 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,308 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,308 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,308 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,309 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,309 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,309 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,309 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,309 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,309 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,309 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,313 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,313 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,313 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,313 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,314 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,314 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,314 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,314 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,314 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,315 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,315 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,315 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,315 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,315 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,316 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,316 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,316 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,316 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,316 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,317 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,317 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,317 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,317 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,318 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,318 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,319 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,320 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,321 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,322 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,322 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,322 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,322 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,322 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,322 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,322 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,323 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,323 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,323 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,323 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,323 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,323 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,323 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,323 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,324 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,324 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,324 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,324 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,325 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,326 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,327 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,328 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,329 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,330 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,331 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,332 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,333 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:00:12 BoogieIcfgContainer [2018-11-09 22:00:12,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-09 22:00:12,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 22:00:12,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 22:00:12,337 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 22:00:12,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:48:23" (3/4) ... [2018-11-09 22:00:12,341 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-09 22:00:12,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-09 22:00:12,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure re_insert [2018-11-09 22:00:12,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2018-11-09 22:00:12,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2018-11-09 22:00:12,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-09 22:00:12,348 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-09 22:00:12,349 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_list_containing_x [2018-11-09 22:00:12,349 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure remove [2018-11-09 22:00:12,353 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-09 22:00:12,354 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-09 22:00:12,354 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-09 22:00:12,373 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(list == malloc(sizeof(struct node))) && !(0 == n)) && \valid[malloc(sizeof(struct node))] == 1) && 1 == \valid[n]) && !(0 == malloc(sizeof(struct node)))) && (\exists main_~n~0.offset : int, main_~n~0.base : int :: (((((((0 == #memory_$Pointer$[main_~n~0.base][main_~n~0.offset + 4] && main_~n~0.base == #memory_$Pointer$[list][#memory_$Pointer$[main_~n~0.base][main_~n~0.offset] + 4]) && #memory_$Pointer$[x][x] == #memory_$Pointer$[main_~n~0.base][main_~n~0.offset]) && #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[main_~n~0.base][main_~n~0.offset] + 4] == main_~n~0.offset) && #memory_$Pointer$[x][x] == #memory_$Pointer$[main_~n~0.base][main_~n~0.offset]) && 0 == #memory_$Pointer$[main_~n~0.base][main_~n~0.offset + 4]) && 0 == #memory_$Pointer$[main_~n~0.base][main_~n~0.offset]) && !(#memory_$Pointer$[x][#memory_$Pointer$[main_~n~0.base][main_~n~0.offset] + 4] == x)) && !(main_~n~0.base == x))) && \valid[list] == 1) && 0 == #memory_$Pointer$[#memory_$Pointer$[x][x]][list + 4]) && \valid[x] == 1) && ((((0 == #memory_$Pointer$[x][list + 4] && 0 == #memory_$Pointer$[x][list + 4]) && !(x == malloc(sizeof(struct node)))) && 0 == x) || (x == list && list == x))) && 0 == malloc(sizeof(struct node))) && (((((((tail == #memory_$Pointer$[list][n] && 0 == n) && !(0 == list)) && list == tail) && list == tail) && n == #memory_$Pointer$[list][n + 4]) && n == #memory_$Pointer$[list][n]) || ((((((0 == n && !(0 == list)) && list == tail) && list == tail) && tail == #memory_$Pointer$[n][n]) && 0 == #memory_$Pointer$[n][n + 4]) && n == #memory_$Pointer$[list][tail + 4]))) && list == 0) || ((((((((((((!(list == malloc(sizeof(struct node))) && #memory_$Pointer$[list][x + 4] == x) && 1 == \valid[list]) && n == #memory_$Pointer$[#memory_$Pointer$[n][n]][tail + 4]) && \valid[malloc(sizeof(struct node))] == 1) && !(0 == malloc(sizeof(struct node)))) && malloc(sizeof(struct node)) == 0) && !(0 == n)) && 1 == \valid[x]) && 0 == tail) && #memory_$Pointer$[n][n] == tail) && x == 0 && #memory_$Pointer$[x][x + 4] == 0) && (((((((tail == #memory_$Pointer$[list][n] && 0 == n) && !(0 == list)) && list == tail) && list == tail) && n == #memory_$Pointer$[list][n + 4]) && n == #memory_$Pointer$[list][n]) || ((((((0 == n && !(0 == list)) && list == tail) && list == tail) && tail == #memory_$Pointer$[n][n]) && 0 == #memory_$Pointer$[n][n + 4]) && n == #memory_$Pointer$[list][tail + 4])))) || ((((!(0 == tail) && ((((((((((0 == #memory_$Pointer$[n][n + 4] && #memory_$Pointer$[list][4] == n) && #memory_$Pointer$[n][list] == 0) && list == n) && 0 == #memory_$Pointer$[n][n + 4]) && list == #memory_$Pointer$[n][list]) && n == #memory_$Pointer$[#memory_$Pointer$[n][list]][4]) || (((((list == n && 0 == #memory_$Pointer$[n][n + 4]) && #memory_$Pointer$[n][list] == 0) && list == n) && n == #memory_$Pointer$[list][n + 4]) && list == #memory_$Pointer$[list][list])) && list == malloc(sizeof(struct node))) && ((((((((0 == n && 0 == #memory_$Pointer$[n][n + 4]) && 0 == #memory_$Pointer$[n][n + 4]) && (\exists main_~tail~0.offset : int :: n == #memory_$Pointer$[list][main_~tail~0.offset + 4] && #memory_$Pointer$[list][main_~tail~0.offset + 4] == n)) && list == tail && tail == list) && list == x) && (!(0 == #memory_$Pointer$[n][n]) || n == tail)) && malloc(sizeof(struct node)) == 0) || ((!(0 == x) && list == tail && tail == list) && list == x))) || ((0 == #memory_$Pointer$[list][list + 4] && ((((((((0 == n && 0 == #memory_$Pointer$[n][n + 4]) && 0 == #memory_$Pointer$[n][n + 4]) && (\exists main_~tail~0.offset : int :: n == #memory_$Pointer$[list][main_~tail~0.offset + 4] && #memory_$Pointer$[list][main_~tail~0.offset + 4] == n)) && list == tail && tail == list) && list == x) && (!(0 == #memory_$Pointer$[n][n]) || n == tail)) && malloc(sizeof(struct node)) == 0) || ((!(0 == x) && list == tail && tail == list) && list == x))) && 0 == #memory_$Pointer$[list][list + 4]))) && ((((0 == #memory_$Pointer$[x][list + 4] && 0 == #memory_$Pointer$[x][list + 4]) && !(x == malloc(sizeof(struct node)))) && 0 == x) || (x == list && list == x))) && 1 == \valid[list]) && list == 0) [2018-11-09 22:00:12,387 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_557ef115-f084-4b7a-b640-ccc84e15eb0a/bin-2019/uautomizer/witness.graphml [2018-11-09 22:00:12,387 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 22:00:12,388 INFO L168 Benchmark]: Toolchain (without parser) took 709623.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 957.6 MB in the beginning and 942.2 MB in the end (delta: 15.4 MB). Peak memory consumption was 193.2 MB. Max. memory is 11.5 GB. [2018-11-09 22:00:12,388 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:00:12,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.60 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-09 22:00:12,388 INFO L168 Benchmark]: Boogie Preprocessor took 87.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-09 22:00:12,388 INFO L168 Benchmark]: RCFGBuilder took 371.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-11-09 22:00:12,388 INFO L168 Benchmark]: TraceAbstraction took 708801.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.3 MB). Free memory was 1.1 GB in the beginning and 942.2 MB in the end (delta: 142.6 MB). Peak memory consumption was 294.2 MB. Max. memory is 11.5 GB. [2018-11-09 22:00:12,389 INFO L168 Benchmark]: Witness Printer took 49.99 ms. Allocated memory is still 1.2 GB. Free memory is still 942.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:00:12,389 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.60 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.8 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 930.8 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 371.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 708801.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.3 MB). Free memory was 1.1 GB in the beginning and 942.2 MB in the end (delta: 142.6 MB). Peak memory consumption was 294.2 MB. Max. memory is 11.5 GB. * Witness Printer took 49.99 ms. Allocated memory is still 1.2 GB. Free memory is still 942.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~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 Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~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 Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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[main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~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$.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[main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~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 Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~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 Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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[main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~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$.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[main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$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_$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$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant [2018-11-09 22:00:12,461 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,462 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,462 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,462 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,462 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,462 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,463 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,463 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,463 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,481 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,481 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,481 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,482 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,482 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,482 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,482 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,483 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,483 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,484 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,484 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,501 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,501 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,501 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,501 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,502 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,503 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,503 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,503 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,503 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,506 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,507 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,507 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,507 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,507 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,507 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,507 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,507 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,507 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,507 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,508 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,508 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,508 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,508 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,508 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,508 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,508 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,509 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,509 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,509 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,509 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,509 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,509 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,509 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,509 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,509 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,509 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,510 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,510 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,510 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,510 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,510 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,511 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,511 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,511 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,511 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,523 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,523 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,523 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,523 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,523 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,524 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,524 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,524 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,524 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,524 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,524 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,524 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,525 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,526 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,526 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,526 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,526 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,526 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,526 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,526 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,526 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,526 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,526 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,526 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,527 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,527 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,527 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,544 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,544 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,544 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,544 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,545 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,546 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,546 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,547 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,547 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,547 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,547 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,547 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,547 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,547 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,548 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,548 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,548 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,548 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,548 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,549 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,566 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,567 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,567 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,567 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,567 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,567 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,567 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,567 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,567 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,567 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,567 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,568 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,568 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,568 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,568 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,568 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,568 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.offset,QUANTIFIED] [2018-11-09 22:00:12,568 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0.base,QUANTIFIED] [2018-11-09 22:00:12,568 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,568 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,568 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,589 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,589 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,589 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,589 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,590 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,591 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,591 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,591 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,612 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,612 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,612 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,612 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,612 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,612 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,613 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,613 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,613 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,613 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,613 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,613 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,613 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,613 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,613 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,614 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,614 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,614 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,614 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,634 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,634 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,634 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,634 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,634 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~tail~0.offset,QUANTIFIED] [2018-11-09 22:00:12,635 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,635 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,635 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-09 22:00:12,635 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-09 22:00:12,635 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,635 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,635 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,635 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,635 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,636 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,636 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,636 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,636 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,636 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,636 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,636 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,636 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,636 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,636 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,637 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,637 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,637 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,637 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,637 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,659 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,660 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,660 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,660 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,660 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,660 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,660 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,660 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,660 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,660 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,660 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,660 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,660 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,661 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,661 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,661 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,661 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,661 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,661 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,661 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,661 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,661 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,661 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,661 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,662 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,662 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,662 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,662 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,662 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,662 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-09 22:00:12,681 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((!(list == malloc(sizeof(struct node))) && !(0 == n)) && \valid[malloc(sizeof(struct node))] == 1) && 1 == \valid[n]) && !(0 == malloc(sizeof(struct node)))) && (\exists main_~n~0.offset : int, main_~n~0.base : int :: (((((((0 == #memory_$Pointer$[main_~n~0.base][main_~n~0.offset + 4] && main_~n~0.base == #memory_$Pointer$[list][#memory_$Pointer$[main_~n~0.base][main_~n~0.offset] + 4]) && #memory_$Pointer$[x][x] == #memory_$Pointer$[main_~n~0.base][main_~n~0.offset]) && #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[main_~n~0.base][main_~n~0.offset] + 4] == main_~n~0.offset) && #memory_$Pointer$[x][x] == #memory_$Pointer$[main_~n~0.base][main_~n~0.offset]) && 0 == #memory_$Pointer$[main_~n~0.base][main_~n~0.offset + 4]) && 0 == #memory_$Pointer$[main_~n~0.base][main_~n~0.offset]) && !(#memory_$Pointer$[x][#memory_$Pointer$[main_~n~0.base][main_~n~0.offset] + 4] == x)) && !(main_~n~0.base == x))) && \valid[list] == 1) && 0 == #memory_$Pointer$[#memory_$Pointer$[x][x]][list + 4]) && \valid[x] == 1) && ((((0 == #memory_$Pointer$[x][list + 4] && 0 == #memory_$Pointer$[x][list + 4]) && !(x == malloc(sizeof(struct node)))) && 0 == x) || (x == list && list == x))) && 0 == malloc(sizeof(struct node))) && (((((((tail == #memory_$Pointer$[list][n] && 0 == n) && !(0 == list)) && list == tail) && list == tail) && n == #memory_$Pointer$[list][n + 4]) && n == #memory_$Pointer$[list][n]) || ((((((0 == n && !(0 == list)) && list == tail) && list == tail) && tail == #memory_$Pointer$[n][n]) && 0 == #memory_$Pointer$[n][n + 4]) && n == #memory_$Pointer$[list][tail + 4]))) && list == 0) || ((((((((((((!(list == malloc(sizeof(struct node))) && #memory_$Pointer$[list][x + 4] == x) && 1 == \valid[list]) && n == #memory_$Pointer$[#memory_$Pointer$[n][n]][tail + 4]) && \valid[malloc(sizeof(struct node))] == 1) && !(0 == malloc(sizeof(struct node)))) && malloc(sizeof(struct node)) == 0) && !(0 == n)) && 1 == \valid[x]) && 0 == tail) && #memory_$Pointer$[n][n] == tail) && x == 0 && #memory_$Pointer$[x][x + 4] == 0) && (((((((tail == #memory_$Pointer$[list][n] && 0 == n) && !(0 == list)) && list == tail) && list == tail) && n == #memory_$Pointer$[list][n + 4]) && n == #memory_$Pointer$[list][n]) || ((((((0 == n && !(0 == list)) && list == tail) && list == tail) && tail == #memory_$Pointer$[n][n]) && 0 == #memory_$Pointer$[n][n + 4]) && n == #memory_$Pointer$[list][tail + 4])))) || ((((!(0 == tail) && ((((((((((0 == #memory_$Pointer$[n][n + 4] && #memory_$Pointer$[list][4] == n) && #memory_$Pointer$[n][list] == 0) && list == n) && 0 == #memory_$Pointer$[n][n + 4]) && list == #memory_$Pointer$[n][list]) && n == #memory_$Pointer$[#memory_$Pointer$[n][list]][4]) || (((((list == n && 0 == #memory_$Pointer$[n][n + 4]) && #memory_$Pointer$[n][list] == 0) && list == n) && n == #memory_$Pointer$[list][n + 4]) && list == #memory_$Pointer$[list][list])) && list == malloc(sizeof(struct node))) && ((((((((0 == n && 0 == #memory_$Pointer$[n][n + 4]) && 0 == #memory_$Pointer$[n][n + 4]) && (\exists main_~tail~0.offset : int :: n == #memory_$Pointer$[list][main_~tail~0.offset + 4] && #memory_$Pointer$[list][main_~tail~0.offset + 4] == n)) && list == tail && tail == list) && list == x) && (!(0 == #memory_$Pointer$[n][n]) || n == tail)) && malloc(sizeof(struct node)) == 0) || ((!(0 == x) && list == tail && tail == list) && list == x))) || ((0 == #memory_$Pointer$[list][list + 4] && ((((((((0 == n && 0 == #memory_$Pointer$[n][n + 4]) && 0 == #memory_$Pointer$[n][n + 4]) && (\exists main_~tail~0.offset : int :: n == #memory_$Pointer$[list][main_~tail~0.offset + 4] && #memory_$Pointer$[list][main_~tail~0.offset + 4] == n)) && list == tail && tail == list) && list == x) && (!(0 == #memory_$Pointer$[n][n]) || n == tail)) && malloc(sizeof(struct node)) == 0) || ((!(0 == x) && list == tail && tail == list) && list == x))) && 0 == #memory_$Pointer$[list][list + 4]))) && ((((0 == #memory_$Pointer$[x][list + 4] && 0 == #memory_$Pointer$[x][list + 4]) && !(x == malloc(sizeof(struct node)))) && 0 == x) || (x == list && list == x))) && 1 == \valid[list]) && list == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 86 locations, 1 error locations. SAFE Result, 708.6s OverallTime, 24 OverallIterations, 6 TraceHistogramMax, 344.5s AutomataDifference, 0.0s DeadEndRemovalTime, 295.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1914 SDtfs, 4199 SDslu, 15126 SDs, 0 SdLazy, 26619 SolverSat, 3113 SolverUnsat, 206 SolverUnknown, 0 SolverNotchecked, 282.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2232 GetRequests, 1034 SyntacticMatches, 75 SemanticMatches, 1123 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 23661 ImplicationChecksByTransitivity, 107.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 545 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 340 PreInvPairs, 372 NumberOfFragments, 3890 HoareAnnotationTreeSize, 340 FomulaSimplifications, 2478693 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 2411909 FormulaSimplificationTreeSizeReductionInter, 294.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 66.6s InterpolantComputationTime, 2917 NumberOfCodeBlocks, 2914 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2877 ConstructedInterpolants, 400 QuantifiedInterpolants, 5885729 SizeOfPredicates, 310 NumberOfNonLiveVariables, 4394 ConjunctsInSsa, 913 ConjunctsInUnsatCore, 40 InterpolantComputations, 8 PerfectInterpolantSequences, 985/1608 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...