./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/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.24-678e011 [2019-11-20 05:34:39,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:34:39,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:34:39,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:34:39,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:34:39,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:34:39,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:34:39,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:34:39,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:34:39,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:34:39,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:34:39,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:34:39,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:34:39,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:34:39,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:34:39,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:34:39,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:34:39,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:34:39,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:34:39,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:34:39,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:34:39,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:34:39,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:34:39,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:34:39,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:34:39,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:34:39,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:34:39,562 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:34:39,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:34:39,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:34:39,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:34:39,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:34:39,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:34:39,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:34:39,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:34:39,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:34:39,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:34:39,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:34:39,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:34:39,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:34:39,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:34:39,575 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:34:39,599 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:34:39,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:34:39,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:34:39,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:34:39,601 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:34:39,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:34:39,602 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:34:39,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:34:39,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:34:39,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:34:39,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:34:39,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:34:39,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:34:39,603 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:34:39,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:34:39,604 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:34:39,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:34:39,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:34:39,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:34:39,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:34:39,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:34:39,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:34:39,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:34:39,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:34:39,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:34:39,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:34:39,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:34:39,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:34:39,606 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/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 [2019-11-20 05:34:39,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:34:39,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:34:39,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:34:39,766 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:34:39,767 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:34:39,767 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/../../sv-benchmarks/c/heap-manipulation/dancing.i [2019-11-20 05:34:39,818 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/data/c4af8623c/f8f912d256164b5fbebea54ae79f131b/FLAG95ce98464 [2019-11-20 05:34:40,289 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:34:40,290 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/sv-benchmarks/c/heap-manipulation/dancing.i [2019-11-20 05:34:40,302 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/data/c4af8623c/f8f912d256164b5fbebea54ae79f131b/FLAG95ce98464 [2019-11-20 05:34:40,317 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/data/c4af8623c/f8f912d256164b5fbebea54ae79f131b [2019-11-20 05:34:40,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:34:40,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:34:40,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:34:40,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:34:40,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:34:40,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:34:40" (1/1) ... [2019-11-20 05:34:40,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc12dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40, skipping insertion in model container [2019-11-20 05:34:40,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:34:40" (1/1) ... [2019-11-20 05:34:40,342 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:34:40,391 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:34:40,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:34:40,753 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:34:40,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:34:40,872 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:34:40,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40 WrapperNode [2019-11-20 05:34:40,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:34:40,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:34:40,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:34:40,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:34:40,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40" (1/1) ... [2019-11-20 05:34:40,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40" (1/1) ... [2019-11-20 05:34:40,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:34:40,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:34:40,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:34:40,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:34:40,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40" (1/1) ... [2019-11-20 05:34:40,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40" (1/1) ... [2019-11-20 05:34:40,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40" (1/1) ... [2019-11-20 05:34:40,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40" (1/1) ... [2019-11-20 05:34:40,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40" (1/1) ... [2019-11-20 05:34:40,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40" (1/1) ... [2019-11-20 05:34:40,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40" (1/1) ... [2019-11-20 05:34:40,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:34:40,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:34:40,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:34:40,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:34:40,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/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 [2019-11-20 05:34:41,028 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2019-11-20 05:34:41,029 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2019-11-20 05:34:41,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 05:34:41,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 05:34:41,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 05:34:41,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 05:34:41,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 05:34:41,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:34:41,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:34:41,396 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:34:41,396 INFO L285 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-20 05:34:41,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:34:41 BoogieIcfgContainer [2019-11-20 05:34:41,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:34:41,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:34:41,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:34:41,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:34:41,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:34:40" (1/3) ... [2019-11-20 05:34:41,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5decd58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:34:41, skipping insertion in model container [2019-11-20 05:34:41,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:34:40" (2/3) ... [2019-11-20 05:34:41,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5decd58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:34:41, skipping insertion in model container [2019-11-20 05:34:41,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:34:41" (3/3) ... [2019-11-20 05:34:41,404 INFO L109 eAbstractionObserver]: Analyzing ICFG dancing.i [2019-11-20 05:34:41,411 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:34:41,416 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-20 05:34:41,423 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-20 05:34:41,443 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:34:41,443 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:34:41,443 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:34:41,444 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:34:41,444 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:34:41,444 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:34:41,444 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:34:41,444 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:34:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-11-20 05:34:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 05:34:41,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:41,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:41,467 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:41,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:41,472 INFO L82 PathProgramCache]: Analyzing trace with hash -390992366, now seen corresponding path program 1 times [2019-11-20 05:34:41,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:41,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223184635] [2019-11-20 05:34:41,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:41,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223184635] [2019-11-20 05:34:41,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:41,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:34:41,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526457662] [2019-11-20 05:34:41,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 05:34:41,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 05:34:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 05:34:41,632 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-11-20 05:34:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:41,654 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-11-20 05:34:41,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 05:34:41,655 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-11-20 05:34:41,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:41,664 INFO L225 Difference]: With dead ends: 71 [2019-11-20 05:34:41,664 INFO L226 Difference]: Without dead ends: 34 [2019-11-20 05:34:41,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 05:34:41,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-20 05:34:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-20 05:34:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-20 05:34:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2019-11-20 05:34:41,705 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 17 [2019-11-20 05:34:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:41,706 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2019-11-20 05:34:41,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 05:34:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2019-11-20 05:34:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 05:34:41,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:41,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:41,708 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:41,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1529433021, now seen corresponding path program 1 times [2019-11-20 05:34:41,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:41,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004750083] [2019-11-20 05:34:41,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:41,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004750083] [2019-11-20 05:34:41,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:41,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:34:41,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783570340] [2019-11-20 05:34:41,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:34:41,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:41,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:34:41,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:34:41,810 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand 4 states. [2019-11-20 05:34:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:41,877 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-11-20 05:34:41,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:34:41,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-20 05:34:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:41,879 INFO L225 Difference]: With dead ends: 39 [2019-11-20 05:34:41,879 INFO L226 Difference]: Without dead ends: 37 [2019-11-20 05:34:41,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:34:41,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-20 05:34:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-20 05:34:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 05:34:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2019-11-20 05:34:41,886 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 17 [2019-11-20 05:34:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:41,888 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-11-20 05:34:41,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:34:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2019-11-20 05:34:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 05:34:41,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:41,890 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:34:41,890 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:41,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:41,890 INFO L82 PathProgramCache]: Analyzing trace with hash -670941087, now seen corresponding path program 1 times [2019-11-20 05:34:41,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:41,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839854734] [2019-11-20 05:34:41,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 05:34:41,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839854734] [2019-11-20 05:34:41,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:41,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:34:41,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63857223] [2019-11-20 05:34:41,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:34:41,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:41,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:34:41,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:34:41,990 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand 4 states. [2019-11-20 05:34:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:42,041 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-11-20 05:34:42,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:34:42,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-20 05:34:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:42,043 INFO L225 Difference]: With dead ends: 80 [2019-11-20 05:34:42,043 INFO L226 Difference]: Without dead ends: 58 [2019-11-20 05:34:42,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:34:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-20 05:34:42,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-11-20 05:34:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-20 05:34:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2019-11-20 05:34:42,053 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 23 [2019-11-20 05:34:42,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:42,053 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2019-11-20 05:34:42,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:34:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2019-11-20 05:34:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 05:34:42,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:42,055 INFO L410 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] [2019-11-20 05:34:42,055 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:42,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2084669319, now seen corresponding path program 1 times [2019-11-20 05:34:42,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:42,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031409550] [2019-11-20 05:34:42,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:34:42,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031409550] [2019-11-20 05:34:42,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17704648] [2019-11-20 05:34:42,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:42,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 05:34:42,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:42,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:34:42,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-20 05:34:42,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827341446] [2019-11-20 05:34:42,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 05:34:42,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:42,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 05:34:42,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-20 05:34:42,429 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand 12 states. [2019-11-20 05:34:42,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:42,830 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2019-11-20 05:34:42,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 05:34:42,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-20 05:34:42,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:42,833 INFO L225 Difference]: With dead ends: 108 [2019-11-20 05:34:42,834 INFO L226 Difference]: Without dead ends: 78 [2019-11-20 05:34:42,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-11-20 05:34:42,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-20 05:34:42,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 55. [2019-11-20 05:34:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-20 05:34:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2019-11-20 05:34:42,859 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 26 [2019-11-20 05:34:42,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:42,860 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2019-11-20 05:34:42,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 05:34:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2019-11-20 05:34:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 05:34:42,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:42,868 INFO L410 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] [2019-11-20 05:34:43,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:43,079 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash -155348295, now seen corresponding path program 1 times [2019-11-20 05:34:43,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:43,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305947725] [2019-11-20 05:34:43,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:34:43,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305947725] [2019-11-20 05:34:43,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:34:43,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 05:34:43,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618769768] [2019-11-20 05:34:43,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:34:43,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:43,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:34:43,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:34:43,193 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 5 states. [2019-11-20 05:34:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:34:43,221 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2019-11-20 05:34:43,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:34:43,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-20 05:34:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:34:43,223 INFO L225 Difference]: With dead ends: 59 [2019-11-20 05:34:43,223 INFO L226 Difference]: Without dead ends: 55 [2019-11-20 05:34:43,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:34:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-20 05:34:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2019-11-20 05:34:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-20 05:34:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2019-11-20 05:34:43,233 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 28 [2019-11-20 05:34:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:34:43,233 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2019-11-20 05:34:43,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:34:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2019-11-20 05:34:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 05:34:43,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:34:43,235 INFO L410 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] [2019-11-20 05:34:43,235 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:34:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:34:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1907184921, now seen corresponding path program 1 times [2019-11-20 05:34:43,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:34:43,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202796077] [2019-11-20 05:34:43,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:34:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 05:34:43,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202796077] [2019-11-20 05:34:43,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639758962] [2019-11-20 05:34:43,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:34:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:34:43,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 05:34:43,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:34:43,534 INFO L343 Elim1Store]: treesize reduction 28, result has 60.6 percent of original size [2019-11-20 05:34:43,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 52 [2019-11-20 05:34:43,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:34:43,570 INFO L567 ElimStorePlain]: treesize reduction 18, result has 67.9 percent of original size [2019-11-20 05:34:43,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:34:43,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:53 [2019-11-20 05:34:43,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:34:43,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:34:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:34:43,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:34:43,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9] total 11 [2019-11-20 05:34:43,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689665507] [2019-11-20 05:34:43,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 05:34:43,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:34:43,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 05:34:43,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-20 05:34:43,851 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand 11 states. [2019-11-20 05:35:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:02,600 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2019-11-20 05:35:02,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 05:35:02,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-11-20 05:35:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:02,603 INFO L225 Difference]: With dead ends: 149 [2019-11-20 05:35:02,603 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 05:35:02,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-11-20 05:35:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 05:35:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 85. [2019-11-20 05:35:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 05:35:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2019-11-20 05:35:02,649 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 28 [2019-11-20 05:35:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:02,649 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2019-11-20 05:35:02,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 05:35:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2019-11-20 05:35:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 05:35:02,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:02,651 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 05:35:02,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:35:02,851 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:35:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash 333454003, now seen corresponding path program 1 times [2019-11-20 05:35:02,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:35:02,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064623535] [2019-11-20 05:35:02,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:35:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:35:02,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064623535] [2019-11-20 05:35:02,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:35:02,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 05:35:02,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158922319] [2019-11-20 05:35:02,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:35:02,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:35:02,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:35:02,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:35:02,965 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand 5 states. [2019-11-20 05:35:03,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:03,094 INFO L93 Difference]: Finished difference Result 151 states and 208 transitions. [2019-11-20 05:35:03,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:35:03,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-20 05:35:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:03,096 INFO L225 Difference]: With dead ends: 151 [2019-11-20 05:35:03,096 INFO L226 Difference]: Without dead ends: 71 [2019-11-20 05:35:03,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:35:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-20 05:35:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2019-11-20 05:35:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-20 05:35:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2019-11-20 05:35:03,107 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 29 [2019-11-20 05:35:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:03,108 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2019-11-20 05:35:03,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:35:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2019-11-20 05:35:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 05:35:03,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:03,109 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-20 05:35:03,109 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:35:03,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:03,110 INFO L82 PathProgramCache]: Analyzing trace with hash 637156592, now seen corresponding path program 1 times [2019-11-20 05:35:03,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:35:03,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507423774] [2019-11-20 05:35:03,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:35:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 05:35:03,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507423774] [2019-11-20 05:35:03,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:35:03,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 05:35:03,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291727116] [2019-11-20 05:35:03,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:35:03,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:35:03,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:35:03,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:35:03,187 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand 6 states. [2019-11-20 05:35:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:03,243 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2019-11-20 05:35:03,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 05:35:03,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-20 05:35:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:03,244 INFO L225 Difference]: With dead ends: 77 [2019-11-20 05:35:03,245 INFO L226 Difference]: Without dead ends: 75 [2019-11-20 05:35:03,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 05:35:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-20 05:35:03,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2019-11-20 05:35:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 05:35:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2019-11-20 05:35:03,255 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 34 [2019-11-20 05:35:03,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:03,255 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2019-11-20 05:35:03,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:35:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2019-11-20 05:35:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 05:35:03,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:03,257 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-20 05:35:03,258 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:35:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:03,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1092905979, now seen corresponding path program 1 times [2019-11-20 05:35:03,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:35:03,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784300979] [2019-11-20 05:35:03,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:35:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 05:35:03,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784300979] [2019-11-20 05:35:03,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745160880] [2019-11-20 05:35:03,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:35:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:03,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-20 05:35:03,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:35:03,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:35:03,729 INFO L343 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2019-11-20 05:35:03,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 39 treesize of output 60 [2019-11-20 05:35:03,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:03,778 INFO L567 ElimStorePlain]: treesize reduction 22, result has 68.6 percent of original size [2019-11-20 05:35:03,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:03,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:35:03,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:48 [2019-11-20 05:35:03,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:03,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:04,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:04,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:04,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:04,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:35:04,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:04,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:04,475 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:04,476 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2019-11-20 05:35:04,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:04,487 INFO L567 ElimStorePlain]: treesize reduction 14, result has 39.1 percent of original size [2019-11-20 05:35:04,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:04,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:4 [2019-11-20 05:35:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 05:35:04,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:35:04,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-11-20 05:35:04,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708738619] [2019-11-20 05:35:04,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 05:35:04,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:35:04,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 05:35:04,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-11-20 05:35:04,530 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand 20 states. [2019-11-20 05:35:07,188 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-11-20 05:35:07,380 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2019-11-20 05:35:07,939 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-11-20 05:35:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:41,084 INFO L93 Difference]: Finished difference Result 212 states and 286 transitions. [2019-11-20 05:35:41,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-20 05:35:41,087 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-11-20 05:35:41,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:41,089 INFO L225 Difference]: With dead ends: 212 [2019-11-20 05:35:41,089 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 05:35:41,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=496, Invalid=1666, Unknown=0, NotChecked=0, Total=2162 [2019-11-20 05:35:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 05:35:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 53. [2019-11-20 05:35:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 05:35:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2019-11-20 05:35:41,115 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 40 [2019-11-20 05:35:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:41,117 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2019-11-20 05:35:41,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 05:35:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2019-11-20 05:35:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 05:35:41,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:41,119 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-20 05:35:41,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:35:41,322 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:35:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:41,322 INFO L82 PathProgramCache]: Analyzing trace with hash 774101494, now seen corresponding path program 1 times [2019-11-20 05:35:41,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:35:41,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120038384] [2019-11-20 05:35:41,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:35:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 05:35:41,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120038384] [2019-11-20 05:35:41,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379564483] [2019-11-20 05:35:41,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:35:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:41,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 05:35:41,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:35:41,507 INFO L377 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 [2019-11-20 05:35:41,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:41,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:41,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:41,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 05:35:41,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:41,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 05:35:41,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:41,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:41,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:41,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-20 05:35:41,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 05:35:41,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:35:41,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2019-11-20 05:35:41,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299435022] [2019-11-20 05:35:41,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 05:35:41,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:35:41,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 05:35:41,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-20 05:35:41,555 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand 11 states. [2019-11-20 05:35:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:41,777 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions. [2019-11-20 05:35:41,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 05:35:41,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-11-20 05:35:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:41,779 INFO L225 Difference]: With dead ends: 84 [2019-11-20 05:35:41,779 INFO L226 Difference]: Without dead ends: 60 [2019-11-20 05:35:41,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-11-20 05:35:41,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-20 05:35:41,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-11-20 05:35:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-20 05:35:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2019-11-20 05:35:41,795 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 39 [2019-11-20 05:35:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:41,795 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2019-11-20 05:35:41,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 05:35:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2019-11-20 05:35:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 05:35:41,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:41,799 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-20 05:35:42,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:35:42,000 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:35:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:42,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1513117575, now seen corresponding path program 1 times [2019-11-20 05:35:42,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:35:42,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612620401] [2019-11-20 05:35:42,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:35:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 05:35:42,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612620401] [2019-11-20 05:35:42,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982716028] [2019-11-20 05:35:42,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:35:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:42,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-20 05:35:42,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:35:42,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:35:42,934 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:35:42,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:42,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 37 treesize of output 42 [2019-11-20 05:35:42,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:42,979 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-20 05:35:42,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:35:42,987 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:35:42,997 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:42,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 37 treesize of output 42 [2019-11-20 05:35:42,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:43,037 INFO L567 ElimStorePlain]: treesize reduction 18, result has 77.2 percent of original size [2019-11-20 05:35:43,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:43,038 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:61 [2019-11-20 05:35:43,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:43,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:43,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:43,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:44,260 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_23|], 12=[|v_#memory_$Pointer$.base_25|]} [2019-11-20 05:35:44,279 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:44,279 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 93 [2019-11-20 05:35:44,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:44,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:44,336 INFO L343 Elim1Store]: treesize reduction 16, result has 70.9 percent of original size [2019-11-20 05:35:44,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 65 [2019-11-20 05:35:44,337 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:44,356 INFO L567 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2019-11-20 05:35:44,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:44,356 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:33 [2019-11-20 05:35:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 05:35:44,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:35:44,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2019-11-20 05:35:44,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805881073] [2019-11-20 05:35:44,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-20 05:35:44,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:35:44,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-20 05:35:44,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 05:35:44,756 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand 36 states. [2019-11-20 05:35:45,653 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 82 [2019-11-20 05:35:45,944 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 81 [2019-11-20 05:35:46,117 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 72 [2019-11-20 05:35:46,358 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 76 [2019-11-20 05:35:46,694 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 79 [2019-11-20 05:35:46,849 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 66 [2019-11-20 05:35:47,052 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 86 [2019-11-20 05:35:47,250 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 77 [2019-11-20 05:35:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:50,761 INFO L93 Difference]: Finished difference Result 227 states and 297 transitions. [2019-11-20 05:35:50,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-11-20 05:35:50,762 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 40 [2019-11-20 05:35:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:50,764 INFO L225 Difference]: With dead ends: 227 [2019-11-20 05:35:50,764 INFO L226 Difference]: Without dead ends: 198 [2019-11-20 05:35:50,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=770, Invalid=6540, Unknown=0, NotChecked=0, Total=7310 [2019-11-20 05:35:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-20 05:35:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 128. [2019-11-20 05:35:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-20 05:35:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 172 transitions. [2019-11-20 05:35:50,790 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 172 transitions. Word has length 40 [2019-11-20 05:35:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:50,790 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 172 transitions. [2019-11-20 05:35:50,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-20 05:35:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 172 transitions. [2019-11-20 05:35:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 05:35:50,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:50,792 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-20 05:35:50,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:35:50,995 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:35:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:50,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1275496661, now seen corresponding path program 2 times [2019-11-20 05:35:50,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:35:50,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065143054] [2019-11-20 05:35:50,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:35:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 05:35:51,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065143054] [2019-11-20 05:35:51,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:35:51,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 05:35:51,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854939309] [2019-11-20 05:35:51,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 05:35:51,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:35:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 05:35:51,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:35:51,110 INFO L87 Difference]: Start difference. First operand 128 states and 172 transitions. Second operand 7 states. [2019-11-20 05:35:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:51,189 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2019-11-20 05:35:51,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 05:35:51,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-11-20 05:35:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:51,193 INFO L225 Difference]: With dead ends: 157 [2019-11-20 05:35:51,194 INFO L226 Difference]: Without dead ends: 155 [2019-11-20 05:35:51,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-20 05:35:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-20 05:35:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 133. [2019-11-20 05:35:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-20 05:35:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 178 transitions. [2019-11-20 05:35:51,222 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 178 transitions. Word has length 41 [2019-11-20 05:35:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:51,222 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 178 transitions. [2019-11-20 05:35:51,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 05:35:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2019-11-20 05:35:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 05:35:51,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:51,225 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:35:51,225 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:35:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:51,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1310398175, now seen corresponding path program 1 times [2019-11-20 05:35:51,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:35:51,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47287646] [2019-11-20 05:35:51,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:35:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 05:35:51,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47287646] [2019-11-20 05:35:51,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:35:51,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:35:51,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868562545] [2019-11-20 05:35:51,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:35:51,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:35:51,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:35:51,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:35:51,276 INFO L87 Difference]: Start difference. First operand 133 states and 178 transitions. Second operand 3 states. [2019-11-20 05:35:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:35:51,306 INFO L93 Difference]: Finished difference Result 255 states and 335 transitions. [2019-11-20 05:35:51,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:35:51,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 05:35:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:35:51,308 INFO L225 Difference]: With dead ends: 255 [2019-11-20 05:35:51,309 INFO L226 Difference]: Without dead ends: 133 [2019-11-20 05:35:51,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:35:51,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-20 05:35:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-11-20 05:35:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-20 05:35:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 172 transitions. [2019-11-20 05:35:51,336 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 172 transitions. Word has length 44 [2019-11-20 05:35:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:35:51,337 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 172 transitions. [2019-11-20 05:35:51,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:35:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 172 transitions. [2019-11-20 05:35:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 05:35:51,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:35:51,338 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-20 05:35:51,339 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:35:51,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:35:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1376186339, now seen corresponding path program 1 times [2019-11-20 05:35:51,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:35:51,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919485313] [2019-11-20 05:35:51,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:35:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 05:35:51,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919485313] [2019-11-20 05:35:51,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498011523] [2019-11-20 05:35:51,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:35:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:35:51,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-20 05:35:51,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:35:51,524 INFO L377 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 [2019-11-20 05:35:51,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:51,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:51,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:51,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-20 05:35:51,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:35:51,655 INFO L343 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2019-11-20 05:35:51,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 39 treesize of output 60 [2019-11-20 05:35:51,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:51,719 INFO L567 ElimStorePlain]: treesize reduction 22, result has 80.5 percent of original size [2019-11-20 05:35:51,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:35:51,757 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:51,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 39 treesize of output 88 [2019-11-20 05:35:51,758 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:51,831 INFO L567 ElimStorePlain]: treesize reduction 52, result has 62.6 percent of original size [2019-11-20 05:35:51,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:35:51,832 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:87 [2019-11-20 05:35:51,952 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:51,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 71 [2019-11-20 05:35:51,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:51,965 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:51,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 70 [2019-11-20 05:35:51,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:51,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:51,978 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2019-11-20 05:35:51,979 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:51,984 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 05:35:51,984 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:52,123 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-20 05:35:52,123 INFO L567 ElimStorePlain]: treesize reduction 18, result has 90.1 percent of original size [2019-11-20 05:35:52,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-11-20 05:35:52,124 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:262, output treesize:163 [2019-11-20 05:35:52,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:52,224 INFO L392 ElimStorePlain]: Different costs {9=[|v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_27|], 12=[v_prenex_24], 14=[v_prenex_22], 22=[v_prenex_19, v_prenex_18]} [2019-11-20 05:35:52,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:35:52,426 INFO L237 Elim1Store]: Index analysis took 158 ms [2019-11-20 05:35:52,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 125 [2019-11-20 05:35:52,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:53,498 WARN L191 SmtUtils]: Spent 906.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-11-20 05:35:53,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:53,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:35:53,662 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:53,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 160 [2019-11-20 05:35:53,663 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:54,657 WARN L191 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 118 [2019-11-20 05:35:54,657 INFO L567 ElimStorePlain]: treesize reduction 77, result has 84.9 percent of original size [2019-11-20 05:35:54,714 INFO L343 Elim1Store]: treesize reduction 20, result has 73.0 percent of original size [2019-11-20 05:35:54,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 177 [2019-11-20 05:35:54,715 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:55,324 WARN L191 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 113 [2019-11-20 05:35:55,324 INFO L567 ElimStorePlain]: treesize reduction 7, result has 98.2 percent of original size [2019-11-20 05:35:55,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:35:55,391 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:55,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 137 [2019-11-20 05:35:55,392 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:55,735 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2019-11-20 05:35:55,735 INFO L567 ElimStorePlain]: treesize reduction 70, result has 83.3 percent of original size [2019-11-20 05:35:55,891 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-20 05:35:55,892 INFO L343 Elim1Store]: treesize reduction 32, result has 87.1 percent of original size [2019-11-20 05:35:55,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 323 [2019-11-20 05:35:55,893 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:56,209 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2019-11-20 05:35:56,209 INFO L567 ElimStorePlain]: treesize reduction 120, result has 73.8 percent of original size [2019-11-20 05:35:56,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:35:56,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:35:56,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 260 [2019-11-20 05:35:56,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:35:56,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:56,405 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 05:35:58,253 WARN L191 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 292 DAG size of output: 128 [2019-11-20 05:35:58,253 INFO L567 ElimStorePlain]: treesize reduction 42331, result has 1.2 percent of original size [2019-11-20 05:35:58,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-20 05:35:58,265 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:507, output treesize:584 [2019-11-20 05:35:58,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,500 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-11-20 05:35:58,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:58,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:35:59,206 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 119 [2019-11-20 05:35:59,857 WARN L191 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2019-11-20 05:35:59,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 05:36:00,583 WARN L191 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2019-11-20 05:36:02,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:02,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:02,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:03,480 WARN L191 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 61 [2019-11-20 05:36:03,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:03,491 INFO L392 ElimStorePlain]: Different costs {10=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_prenex_147, v_prenex_148], 18=[v_prenex_144, v_prenex_145]} [2019-11-20 05:36:03,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:36:03,548 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:03,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 117 treesize of output 134 [2019-11-20 05:36:03,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:03,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:03,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:03,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:03,551 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:36:03,698 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-20 05:36:03,698 INFO L567 ElimStorePlain]: treesize reduction 34, result has 89.3 percent of original size [2019-11-20 05:36:03,709 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:03,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 36 [2019-11-20 05:36:03,710 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:36:03,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:03,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:36:03,801 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:03,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 138 [2019-11-20 05:36:03,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:03,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:03,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:03,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:03,805 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:36:03,911 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-20 05:36:03,911 INFO L567 ElimStorePlain]: treesize reduction 36, result has 83.4 percent of original size [2019-11-20 05:36:03,922 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:03,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 40 [2019-11-20 05:36:03,923 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:36:03,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:03,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:36:04,007 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:04,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 148 [2019-11-20 05:36:04,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,012 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:36:04,094 INFO L567 ElimStorePlain]: treesize reduction 36, result has 73.9 percent of original size [2019-11-20 05:36:04,125 INFO L343 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-11-20 05:36:04,126 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 74 [2019-11-20 05:36:04,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:36:04,128 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 05:36:04,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:04,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:36:04,149 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:348, output treesize:7 [2019-11-20 05:36:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 05:36:04,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:36:04,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 16 [2019-11-20 05:36:04,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191493120] [2019-11-20 05:36:04,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 05:36:04,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:36:04,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 05:36:04,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-20 05:36:04,232 INFO L87 Difference]: Start difference. First operand 131 states and 172 transitions. Second operand 16 states. [2019-11-20 05:36:06,685 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-20 05:36:09,103 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 156 [2019-11-20 05:36:18,911 WARN L191 SmtUtils]: Spent 9.69 s on a formula simplification. DAG size of input: 182 DAG size of output: 162 [2019-11-20 05:36:23,511 WARN L191 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 168 DAG size of output: 165 [2019-11-20 05:36:23,806 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 130 [2019-11-20 05:36:29,702 WARN L191 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 214 DAG size of output: 208 [2019-11-20 05:36:39,179 WARN L191 SmtUtils]: Spent 9.41 s on a formula simplification. DAG size of input: 216 DAG size of output: 210 [2019-11-20 05:36:39,976 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-11-20 05:36:40,766 WARN L191 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 120 [2019-11-20 05:36:43,383 WARN L191 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 183 [2019-11-20 05:36:51,347 WARN L191 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 216 DAG size of output: 210 [2019-11-20 05:36:57,709 WARN L191 SmtUtils]: Spent 6.26 s on a formula simplification. DAG size of input: 184 DAG size of output: 164 [2019-11-20 05:36:58,262 WARN L191 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 181 [2019-11-20 05:36:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:36:58,372 INFO L93 Difference]: Finished difference Result 292 states and 381 transitions. [2019-11-20 05:36:58,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 05:36:58,375 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2019-11-20 05:36:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:36:58,376 INFO L225 Difference]: With dead ends: 292 [2019-11-20 05:36:58,376 INFO L226 Difference]: Without dead ends: 177 [2019-11-20 05:36:58,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2019-11-20 05:36:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-20 05:36:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2019-11-20 05:36:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-20 05:36:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2019-11-20 05:36:58,402 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 44 [2019-11-20 05:36:58,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:36:58,402 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2019-11-20 05:36:58,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 05:36:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2019-11-20 05:36:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 05:36:58,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:36:58,407 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:36:58,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:36:58,613 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:36:58,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:36:58,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1523797054, now seen corresponding path program 2 times [2019-11-20 05:36:58,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:36:58,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163798023] [2019-11-20 05:36:58,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:36:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:36:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:36:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:36:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:36:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:36:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:36:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 05:36:59,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163798023] [2019-11-20 05:36:59,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547708507] [2019-11-20 05:36:59,168 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:36:59,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:36:59,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:36:59,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-20 05:36:59,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:36:59,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:36:59,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:36:59,295 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:36:59,312 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:59,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 39 treesize of output 44 [2019-11-20 05:36:59,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:36:59,387 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-20 05:36:59,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:36:59,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:36:59,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:36:59,412 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:36:59,412 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 39 treesize of output 44 [2019-11-20 05:36:59,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:36:59,452 INFO L567 ElimStorePlain]: treesize reduction 18, result has 77.2 percent of original size [2019-11-20 05:36:59,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:36:59,452 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:61 [2019-11-20 05:36:59,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:59,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:59,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:36:59,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:37:00,382 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:37:00,461 INFO L343 Elim1Store]: treesize reduction 24, result has 78.2 percent of original size [2019-11-20 05:37:00,461 INFO L377 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 153 [2019-11-20 05:37:00,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:37:00,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:37:00,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:37:00,471 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:00,519 INFO L567 ElimStorePlain]: treesize reduction 87, result has 47.6 percent of original size [2019-11-20 05:37:00,532 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:00,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 76 [2019-11-20 05:37:00,532 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:37:00,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:37:00,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:37:00,547 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:181, output treesize:58 [2019-11-20 05:37:08,971 WARN L191 SmtUtils]: Spent 8.04 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 05:37:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 05:37:09,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:37:09,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 28 [2019-11-20 05:37:09,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209406125] [2019-11-20 05:37:09,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-20 05:37:09,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:37:09,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-20 05:37:09,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2019-11-20 05:37:09,270 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand 28 states. [2019-11-20 05:37:09,812 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 69 [2019-11-20 05:37:09,981 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 74 [2019-11-20 05:37:10,419 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 51 [2019-11-20 05:37:37,658 WARN L191 SmtUtils]: Spent 15.04 s on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-11-20 05:37:52,206 WARN L191 SmtUtils]: Spent 12.40 s on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-11-20 05:38:04,959 WARN L191 SmtUtils]: Spent 10.57 s on a formula simplification. DAG size of input: 81 DAG size of output: 81 [2019-11-20 05:38:19,944 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 79 [2019-11-20 05:38:20,114 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 75 [2019-11-20 05:38:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:28,232 INFO L93 Difference]: Finished difference Result 287 states and 370 transitions. [2019-11-20 05:38:28,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-20 05:38:28,233 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2019-11-20 05:38:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:28,234 INFO L225 Difference]: With dead ends: 287 [2019-11-20 05:38:28,234 INFO L226 Difference]: Without dead ends: 191 [2019-11-20 05:38:28,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 53.7s TimeCoverageRelationStatistics Valid=407, Invalid=2897, Unknown=2, NotChecked=0, Total=3306 [2019-11-20 05:38:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-20 05:38:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2019-11-20 05:38:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-20 05:38:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 222 transitions. [2019-11-20 05:38:28,261 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 222 transitions. Word has length 47 [2019-11-20 05:38:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:28,261 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 222 transitions. [2019-11-20 05:38:28,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-20 05:38:28,261 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 222 transitions. [2019-11-20 05:38:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 05:38:28,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:28,263 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-20 05:38:28,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:38:28,467 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:28,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:28,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1031600160, now seen corresponding path program 1 times [2019-11-20 05:38:28,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:28,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280758960] [2019-11-20 05:38:28,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 05:38:29,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280758960] [2019-11-20 05:38:29,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219545916] [2019-11-20 05:38:29,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:38:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:29,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-20 05:38:29,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:38:29,139 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-11-20 05:38:29,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:29,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:29,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:29,145 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:29,155 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:29,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 93 [2019-11-20 05:38:29,155 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:29,188 INFO L567 ElimStorePlain]: treesize reduction 18, result has 80.6 percent of original size [2019-11-20 05:38:29,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:29,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:29,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:29,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:29,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2019-11-20 05:38:29,209 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:29,244 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.3 percent of original size [2019-11-20 05:38:29,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:38:29,245 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:179, output treesize:65 [2019-11-20 05:38:29,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:29,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:29,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:29,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:30,310 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 98 [2019-11-20 05:38:30,311 INFO L343 Elim1Store]: treesize reduction 48, result has 85.2 percent of original size [2019-11-20 05:38:30,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 137 treesize of output 355 [2019-11-20 05:38:30,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:30,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:30,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:30,436 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 42 [2019-11-20 05:38:30,436 INFO L567 ElimStorePlain]: treesize reduction 826, result has 11.5 percent of original size [2019-11-20 05:38:30,439 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:30,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:30,441 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:30,491 INFO L343 Elim1Store]: treesize reduction 18, result has 71.4 percent of original size [2019-11-20 05:38:30,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 112 [2019-11-20 05:38:30,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:30,539 INFO L567 ElimStorePlain]: treesize reduction 25, result has 77.3 percent of original size [2019-11-20 05:38:30,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:38:30,540 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:153, output treesize:85 [2019-11-20 05:38:30,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:30,834 INFO L392 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.base_32|], 30=[|v_#memory_$Pointer$.offset_30|]} [2019-11-20 05:38:30,839 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 05:38:30,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:30,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:30,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:30,845 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:30,846 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:30,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:30,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:30,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 1 [2019-11-20 05:38:30,859 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:30,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:30,861 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_30| vanished before elimination [2019-11-20 05:38:30,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:38:30,861 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:307, output treesize:1 [2019-11-20 05:38:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:38:30,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:38:30,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2019-11-20 05:38:30,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389078804] [2019-11-20 05:38:30,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 05:38:30,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:30,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 05:38:30,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2019-11-20 05:38:30,886 INFO L87 Difference]: Start difference. First operand 174 states and 222 transitions. Second operand 27 states. [2019-11-20 05:38:31,476 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2019-11-20 05:38:31,630 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2019-11-20 05:38:32,905 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 73 [2019-11-20 05:38:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:33,238 INFO L93 Difference]: Finished difference Result 252 states and 326 transitions. [2019-11-20 05:38:33,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-20 05:38:33,238 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 46 [2019-11-20 05:38:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:33,240 INFO L225 Difference]: With dead ends: 252 [2019-11-20 05:38:33,240 INFO L226 Difference]: Without dead ends: 228 [2019-11-20 05:38:33,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=373, Invalid=2177, Unknown=0, NotChecked=0, Total=2550 [2019-11-20 05:38:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-20 05:38:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 193. [2019-11-20 05:38:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-20 05:38:33,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 248 transitions. [2019-11-20 05:38:33,268 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 248 transitions. Word has length 46 [2019-11-20 05:38:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:33,268 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 248 transitions. [2019-11-20 05:38:33,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 05:38:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 248 transitions. [2019-11-20 05:38:33,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 05:38:33,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:33,270 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-20 05:38:33,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:38:33,473 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:33,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:33,474 INFO L82 PathProgramCache]: Analyzing trace with hash -773434722, now seen corresponding path program 1 times [2019-11-20 05:38:33,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:33,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460441899] [2019-11-20 05:38:33,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 05:38:34,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460441899] [2019-11-20 05:38:34,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306518540] [2019-11-20 05:38:34,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:38:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:34,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 67 conjunts are in the unsatisfiable core [2019-11-20 05:38:34,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:38:34,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:34,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:34,326 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:34,350 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:34,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 93 [2019-11-20 05:38:34,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:34,354 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-20 05:38:34,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:34,427 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.9 percent of original size [2019-11-20 05:38:34,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:34,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:34,435 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:34,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:34,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2019-11-20 05:38:34,452 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:34,506 INFO L567 ElimStorePlain]: treesize reduction 18, result has 78.3 percent of original size [2019-11-20 05:38:34,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:38:34,507 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:179, output treesize:65 [2019-11-20 05:38:34,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:34,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:34,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:34,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,358 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:35,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:35,361 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:35,361 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:35,395 INFO L343 Elim1Store]: treesize reduction 24, result has 68.0 percent of original size [2019-11-20 05:38:35,395 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 100 treesize of output 112 [2019-11-20 05:38:35,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:35,449 INFO L567 ElimStorePlain]: treesize reduction 91, result has 65.4 percent of original size [2019-11-20 05:38:35,643 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-20 05:38:35,643 INFO L343 Elim1Store]: treesize reduction 40, result has 82.3 percent of original size [2019-11-20 05:38:35,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 161 treesize of output 264 [2019-11-20 05:38:35,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:35,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:35,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:36,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:36,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:36,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:36,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:36,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:36,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:36,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:36,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:36,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:36,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:36,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:37,244 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 1174 DAG size of output: 38 [2019-11-20 05:38:37,244 INFO L567 ElimStorePlain]: treesize reduction 77310, result has 0.1 percent of original size [2019-11-20 05:38:37,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:38:37,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:153, output treesize:83 [2019-11-20 05:38:37,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:37,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:37,450 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:37,450 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:37,463 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:37,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 88 [2019-11-20 05:38:37,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:37,497 INFO L567 ElimStorePlain]: treesize reduction 41, result has 64.3 percent of original size [2019-11-20 05:38:37,501 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:37,505 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:37,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 35 [2019-11-20 05:38:37,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:37,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:37,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:38:37,514 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:105, output treesize:37 [2019-11-20 05:38:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:38:37,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:38:37,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2019-11-20 05:38:37,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451752671] [2019-11-20 05:38:37,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-20 05:38:37,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:37,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-20 05:38:37,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2019-11-20 05:38:37,732 INFO L87 Difference]: Start difference. First operand 193 states and 248 transitions. Second operand 33 states. [2019-11-20 05:38:38,438 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 73 [2019-11-20 05:38:39,270 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-11-20 05:38:39,835 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2019-11-20 05:38:40,035 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2019-11-20 05:38:40,375 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 78 [2019-11-20 05:38:40,540 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 83 [2019-11-20 05:38:40,819 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 82 [2019-11-20 05:38:41,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:41,388 INFO L93 Difference]: Finished difference Result 265 states and 337 transitions. [2019-11-20 05:38:41,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-20 05:38:41,388 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46 [2019-11-20 05:38:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:41,390 INFO L225 Difference]: With dead ends: 265 [2019-11-20 05:38:41,390 INFO L226 Difference]: Without dead ends: 261 [2019-11-20 05:38:41,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=542, Invalid=3618, Unknown=0, NotChecked=0, Total=4160 [2019-11-20 05:38:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-20 05:38:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 210. [2019-11-20 05:38:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-20 05:38:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 273 transitions. [2019-11-20 05:38:41,422 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 273 transitions. Word has length 46 [2019-11-20 05:38:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:38:41,422 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 273 transitions. [2019-11-20 05:38:41,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-20 05:38:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 273 transitions. [2019-11-20 05:38:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-20 05:38:41,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:38:41,424 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-20 05:38:41,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:38:41,627 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:38:41,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:38:41,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1166461732, now seen corresponding path program 1 times [2019-11-20 05:38:41,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:38:41,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537779183] [2019-11-20 05:38:41,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:38:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 05:38:41,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537779183] [2019-11-20 05:38:41,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270527890] [2019-11-20 05:38:41,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:38:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:38:42,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-20 05:38:42,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:38:42,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:42,136 INFO L343 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2019-11-20 05:38:42,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 39 treesize of output 60 [2019-11-20 05:38:42,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:42,168 INFO L567 ElimStorePlain]: treesize reduction 22, result has 68.6 percent of original size [2019-11-20 05:38:42,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:38:42,169 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:48 [2019-11-20 05:38:42,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:38:42,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,698 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_34|], 28=[|v_#memory_$Pointer$.base_37|]} [2019-11-20 05:38:42,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2019-11-20 05:38:42,701 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:38:42,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:42,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:38:42,715 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:38:42,888 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-11-20 05:38:42,888 INFO L343 Elim1Store]: treesize reduction 62, result has 75.8 percent of original size [2019-11-20 05:38:42,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 64 treesize of output 223 [2019-11-20 05:38:42,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:38:42,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:38:42,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 45 xjuncts. [2019-11-20 05:38:43,573 WARN L191 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 29 [2019-11-20 05:38:43,574 INFO L567 ElimStorePlain]: treesize reduction 42749, result has 0.3 percent of original size [2019-11-20 05:38:43,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 05:38:43,575 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:112 [2019-11-20 05:38:43,778 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:38:43,779 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 49 [2019-11-20 05:38:43,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:38:43,787 INFO L567 ElimStorePlain]: treesize reduction 14, result has 39.1 percent of original size [2019-11-20 05:38:43,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:38:43,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:4 [2019-11-20 05:38:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 05:38:43,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:38:43,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2019-11-20 05:38:43,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742939479] [2019-11-20 05:38:43,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 05:38:43,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:38:43,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 05:38:43,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2019-11-20 05:38:43,804 INFO L87 Difference]: Start difference. First operand 210 states and 273 transitions. Second operand 26 states. [2019-11-20 05:38:46,090 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-20 05:38:46,289 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-11-20 05:38:46,656 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-11-20 05:38:47,161 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-11-20 05:38:47,351 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-11-20 05:38:47,510 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-11-20 05:38:47,656 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-20 05:38:49,808 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-11-20 05:38:49,957 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-20 05:38:50,128 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-11-20 05:38:52,271 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-11-20 05:38:52,587 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-11-20 05:38:52,803 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-11-20 05:38:52,950 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-11-20 05:38:53,105 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-11-20 05:38:53,265 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-11-20 05:38:59,969 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-20 05:38:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:38:59,973 INFO L93 Difference]: Finished difference Result 290 states and 364 transitions. [2019-11-20 05:38:59,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-20 05:38:59,974 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-11-20 05:38:59,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:38:59,976 INFO L225 Difference]: With dead ends: 290 [2019-11-20 05:38:59,976 INFO L226 Difference]: Without dead ends: 234 [2019-11-20 05:38:59,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=556, Invalid=2636, Unknown=0, NotChecked=0, Total=3192 [2019-11-20 05:38:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-20 05:39:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 182. [2019-11-20 05:39:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-20 05:39:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2019-11-20 05:39:00,004 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 46 [2019-11-20 05:39:00,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:39:00,005 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2019-11-20 05:39:00,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 05:39:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2019-11-20 05:39:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 05:39:00,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:39:00,006 INFO L410 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] [2019-11-20 05:39:00,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:39:00,209 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:39:00,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:39:00,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1219363168, now seen corresponding path program 1 times [2019-11-20 05:39:00,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:39:00,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935258546] [2019-11-20 05:39:00,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:39:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 05:39:00,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935258546] [2019-11-20 05:39:00,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926297915] [2019-11-20 05:39:00,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:39:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:00,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-20 05:39:00,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:39:01,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:01,014 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:39:01,035 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:39:01,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 35 treesize of output 40 [2019-11-20 05:39:01,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:01,102 INFO L567 ElimStorePlain]: treesize reduction 12, result has 85.9 percent of original size [2019-11-20 05:39:01,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:01,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:01,115 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:39:01,125 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-20 05:39:01,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 35 treesize of output 24 [2019-11-20 05:39:01,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:01,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:39:01,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:39:01,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2019-11-20 05:39:01,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:01,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:01,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:01,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:39:01,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:02,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:02,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:39:02,412 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 96 [2019-11-20 05:39:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 05:39:02,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:39:02,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2019-11-20 05:39:02,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722983029] [2019-11-20 05:39:02,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 05:39:02,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:39:02,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 05:39:02,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2019-11-20 05:39:02,443 INFO L87 Difference]: Start difference. First operand 182 states and 229 transitions. Second operand 29 states. [2019-11-20 05:39:02,833 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 104 [2019-11-20 05:39:03,057 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 106 [2019-11-20 05:39:03,422 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107 [2019-11-20 05:39:03,609 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 100 [2019-11-20 05:39:04,527 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 110 [2019-11-20 05:39:04,746 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 105 [2019-11-20 05:39:04,931 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2019-11-20 05:39:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:39:04,989 INFO L93 Difference]: Finished difference Result 270 states and 346 transitions. [2019-11-20 05:39:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 05:39:04,989 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 53 [2019-11-20 05:39:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:39:04,990 INFO L225 Difference]: With dead ends: 270 [2019-11-20 05:39:04,991 INFO L226 Difference]: Without dead ends: 210 [2019-11-20 05:39:04,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=331, Invalid=2021, Unknown=0, NotChecked=0, Total=2352 [2019-11-20 05:39:04,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-20 05:39:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2019-11-20 05:39:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-20 05:39:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 235 transitions. [2019-11-20 05:39:05,013 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 235 transitions. Word has length 53 [2019-11-20 05:39:05,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:39:05,013 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 235 transitions. [2019-11-20 05:39:05,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 05:39:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 235 transitions. [2019-11-20 05:39:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 05:39:05,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:39:05,015 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:39:05,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:39:05,217 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:39:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:39:05,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1939331367, now seen corresponding path program 2 times [2019-11-20 05:39:05,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:39:05,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381511945] [2019-11-20 05:39:05,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:39:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:05,937 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 66 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 05:39:05,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381511945] [2019-11-20 05:39:05,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036339051] [2019-11-20 05:39:05,938 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:39:06,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 05:39:06,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:39:06,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-20 05:39:06,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:39:06,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:06,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 24 [2019-11-20 05:39:06,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:06,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:39:06,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:06,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 24 [2019-11-20 05:39:06,117 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:06,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:39:06,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:39:06,129 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:73 [2019-11-20 05:39:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 05:39:06,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:39:06,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2019-11-20 05:39:06,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043186396] [2019-11-20 05:39:06,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-20 05:39:06,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:39:06,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-20 05:39:06,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2019-11-20 05:39:06,822 INFO L87 Difference]: Start difference. First operand 188 states and 235 transitions. Second operand 28 states. [2019-11-20 05:39:08,463 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-20 05:39:08,779 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-20 05:39:09,284 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2019-11-20 05:39:09,530 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2019-11-20 05:39:09,898 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 87 [2019-11-20 05:39:10,098 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 79 [2019-11-20 05:39:10,262 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 77 [2019-11-20 05:39:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:39:10,477 INFO L93 Difference]: Finished difference Result 274 states and 345 transitions. [2019-11-20 05:39:10,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-20 05:39:10,477 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-11-20 05:39:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:39:10,479 INFO L225 Difference]: With dead ends: 274 [2019-11-20 05:39:10,479 INFO L226 Difference]: Without dead ends: 196 [2019-11-20 05:39:10,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=361, Invalid=2395, Unknown=0, NotChecked=0, Total=2756 [2019-11-20 05:39:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-20 05:39:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 148. [2019-11-20 05:39:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-20 05:39:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 177 transitions. [2019-11-20 05:39:10,513 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 177 transitions. Word has length 60 [2019-11-20 05:39:10,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:39:10,513 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 177 transitions. [2019-11-20 05:39:10,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-20 05:39:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 177 transitions. [2019-11-20 05:39:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 05:39:10,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:39:10,519 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:39:10,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:39:10,722 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:39:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:39:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1664417444, now seen corresponding path program 1 times [2019-11-20 05:39:10,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:39:10,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945514183] [2019-11-20 05:39:10,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:39:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 05:39:10,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945514183] [2019-11-20 05:39:10,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035537598] [2019-11-20 05:39:10,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:39:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:11,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-20 05:39:11,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:39:11,083 INFO L377 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 [2019-11-20 05:39:11,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:11,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:39:11,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:39:11,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-20 05:39:11,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:39:11,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-20 05:39:11,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:11,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:39:11,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:39:11,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-20 05:39:11,213 INFO L343 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2019-11-20 05:39:11,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 39 treesize of output 60 [2019-11-20 05:39:11,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:11,241 INFO L567 ElimStorePlain]: treesize reduction 22, result has 65.6 percent of original size [2019-11-20 05:39:11,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:11,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 05:39:11,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:57 [2019-11-20 05:39:11,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:11,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:11,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:11,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:11,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:11,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:11,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:39:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 05:39:11,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:39:11,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-11-20 05:39:11,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120555407] [2019-11-20 05:39:11,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 05:39:11,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:39:11,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 05:39:11,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-11-20 05:39:11,818 INFO L87 Difference]: Start difference. First operand 148 states and 177 transitions. Second operand 23 states. [2019-11-20 05:39:16,192 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-20 05:39:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:39:20,864 INFO L93 Difference]: Finished difference Result 159 states and 188 transitions. [2019-11-20 05:39:20,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 05:39:20,865 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-11-20 05:39:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:39:20,865 INFO L225 Difference]: With dead ends: 159 [2019-11-20 05:39:20,865 INFO L226 Difference]: Without dead ends: 79 [2019-11-20 05:39:20,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2019-11-20 05:39:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-20 05:39:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 53. [2019-11-20 05:39:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 05:39:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2019-11-20 05:39:20,879 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 50 [2019-11-20 05:39:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:39:20,880 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2019-11-20 05:39:20,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 05:39:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2019-11-20 05:39:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 05:39:20,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:39:20,881 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:39:21,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:39:21,085 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:39:21,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:39:21,085 INFO L82 PathProgramCache]: Analyzing trace with hash -447177867, now seen corresponding path program 2 times [2019-11-20 05:39:21,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:39:21,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726233799] [2019-11-20 05:39:21,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:39:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 05:39:21,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726233799] [2019-11-20 05:39:21,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:39:21,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 05:39:21,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739086234] [2019-11-20 05:39:21,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 05:39:21,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:39:21,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 05:39:21,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 05:39:21,152 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 6 states. [2019-11-20 05:39:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:39:21,182 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-20 05:39:21,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:39:21,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-20 05:39:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:39:21,184 INFO L225 Difference]: With dead ends: 62 [2019-11-20 05:39:21,184 INFO L226 Difference]: Without dead ends: 53 [2019-11-20 05:39:21,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 05:39:21,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-20 05:39:21,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-11-20 05:39:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-20 05:39:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-11-20 05:39:21,197 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 52 [2019-11-20 05:39:21,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:39:21,197 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-20 05:39:21,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 05:39:21,197 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-11-20 05:39:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-20 05:39:21,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:39:21,200 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2019-11-20 05:39:21,200 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:39:21,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:39:21,200 INFO L82 PathProgramCache]: Analyzing trace with hash -200998585, now seen corresponding path program 3 times [2019-11-20 05:39:21,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:39:21,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272642362] [2019-11-20 05:39:21,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:39:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:39:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 05:39:21,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272642362] [2019-11-20 05:39:21,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370058629] [2019-11-20 05:39:21,613 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:39:21,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-20 05:39:21,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 05:39:21,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 86 conjunts are in the unsatisfiable core [2019-11-20 05:39:21,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:39:21,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:21,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:21,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 26 [2019-11-20 05:39:21,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:21,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:39:21,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:21,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:21,785 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 26 [2019-11-20 05:39:21,785 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:21,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:39:21,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:39:21,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:62 [2019-11-20 05:39:22,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:22,002 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:39:22,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:22,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:39:22,014 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:39:22,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 100 [2019-11-20 05:39:22,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:22,059 INFO L567 ElimStorePlain]: treesize reduction 43, result has 69.7 percent of original size [2019-11-20 05:39:22,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:22,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:22,064 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:39:22,064 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:39:22,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:22,066 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:39:22,091 INFO L343 Elim1Store]: treesize reduction 18, result has 67.3 percent of original size [2019-11-20 05:39:22,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 82 [2019-11-20 05:39:22,092 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:22,122 INFO L567 ElimStorePlain]: treesize reduction 9, result has 88.6 percent of original size [2019-11-20 05:39:22,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:39:22,123 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:70 [2019-11-20 05:39:22,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:22,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:22,311 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 79 [2019-11-20 05:39:22,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:22,350 INFO L567 ElimStorePlain]: treesize reduction 9, result has 90.6 percent of original size [2019-11-20 05:39:22,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:22,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:39:22,354 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:39:22,372 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:39:22,372 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 92 [2019-11-20 05:39:22,373 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:39:22,406 INFO L567 ElimStorePlain]: treesize reduction 18, result has 77.5 percent of original size [2019-11-20 05:39:22,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:39:22,406 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:62 [2019-11-20 05:39:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 05:39:22,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:39:22,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2019-11-20 05:39:22,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003932764] [2019-11-20 05:39:22,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-20 05:39:22,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:39:22,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-20 05:39:22,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-11-20 05:39:22,817 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 28 states. [2019-11-20 05:39:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:39:24,449 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2019-11-20 05:39:24,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 05:39:24,450 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-11-20 05:39:24,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:39:24,450 INFO L225 Difference]: With dead ends: 59 [2019-11-20 05:39:24,450 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 05:39:24,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=328, Invalid=1742, Unknown=0, NotChecked=0, Total=2070 [2019-11-20 05:39:24,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 05:39:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 05:39:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 05:39:24,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 05:39:24,452 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2019-11-20 05:39:24,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:39:24,452 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 05:39:24,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-20 05:39:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 05:39:24,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 05:39:24,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:39:24,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 05:39:24,902 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 453 DAG size of output: 345 [2019-11-20 05:39:25,341 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 435 DAG size of output: 403 [2019-11-20 05:39:26,881 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 342 DAG size of output: 107 [2019-11-20 05:40:21,877 WARN L191 SmtUtils]: Spent 54.98 s on a formula simplification. DAG size of input: 1242 DAG size of output: 207 [2019-11-20 05:40:22,079 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 86 [2019-11-20 05:40:22,302 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 83 [2019-11-20 05:40:40,993 WARN L191 SmtUtils]: Spent 18.68 s on a formula simplification. DAG size of input: 983 DAG size of output: 1 [2019-11-20 05:40:41,321 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 95 [2019-11-20 05:40:41,877 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 400 DAG size of output: 72 [2019-11-20 05:40:41,879 INFO L447 ceAbstractionStarter]: At program point L609(lines 587 610) the Hoare annotation is: true [2019-11-20 05:40:41,879 INFO L444 ceAbstractionStarter]: For program point L576(lines 576 577) no Hoare annotation was computed. [2019-11-20 05:40:41,879 INFO L440 ceAbstractionStarter]: At program point L572(lines 572 578) the Hoare annotation is: (let ((.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse3 (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base)) (.cse2 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset)) (.cse4 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0.base|)) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|) .cse3 (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|) .cse4) (let ((.cse5 (+ |ULTIMATE.start_main_~#list~0.offset| 4)) (.cse6 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base))) (and .cse0 (<= (+ ULTIMATE.start_main_~n~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= ULTIMATE.start_main_~n~0.offset |ULTIMATE.start_main_~#list~0.offset|) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) .cse3 (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base)) (<= (+ ULTIMATE.start_main_~x~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) .cse5)) .cse2 (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_re_insert_~x.base) ULTIMATE.start_re_insert_~x.offset))) (= 0 (select .cse6 4)) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_remove_~x.base) (= 0 |ULTIMATE.start_main_~#list~0.offset|) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_re_insert_~x.base) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= ULTIMATE.start_main_~x~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) .cse5)) (= ULTIMATE.start_remove_~x.offset ULTIMATE.start_main_~x~0.offset) .cse4 (exists ((ULTIMATE.start_re_insert_~x.base Int)) (let ((.cse8 (select |#memory_$Pointer$.base| ULTIMATE.start_re_insert_~x.base))) (let ((.cse7 (select .cse8 |ULTIMATE.start_main_~#list~0.offset|)) (.cse9 (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (and (not (= 0 ULTIMATE.start_re_insert_~x.base)) (= .cse7 |ULTIMATE.start_main_~#list~0.base|) (= 0 (select .cse8 .cse9)) (= (select (select |#memory_$Pointer$.base| .cse7) .cse9) ULTIMATE.start_re_insert_~x.base))))) (= 0 ULTIMATE.start_re_insert_~x.offset) (not (= ULTIMATE.start_main_~n~0.base 0)) .cse1 (= (select .cse6 0) |ULTIMATE.start_main_~#list~0.offset|) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|))))) [2019-11-20 05:40:41,879 INFO L444 ceAbstractionStarter]: For program point L601(lines 601 602) no Hoare annotation was computed. [2019-11-20 05:40:41,879 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-20 05:40:41,880 INFO L440 ceAbstractionStarter]: At program point L601-2(lines 593 603) the Hoare annotation is: (and (let ((.cse24 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|)) (.cse25 (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (let ((.cse14 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base)) (.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|)) (.cse18 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base)) (.cse15 (+ ULTIMATE.start_main_~n~0.offset 4)) (.cse11 (select .cse24 .cse25))) (let ((.cse20 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|)) (.cse19 (= 0 .cse11)) (.cse22 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset)) (.cse1 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base) 0) 0)) (.cse23 (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1)) (.cse13 (= 0 (select .cse18 .cse15))) (.cse3 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base) 0)) (.cse10 (select .cse17 .cse25)) (.cse7 (= (select .cse14 ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|)) (.cse8 (exists ((ULTIMATE.start_main_~tail~0.offset Int)) (and (= ULTIMATE.start_main_~n~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) (+ ULTIMATE.start_main_~tail~0.offset 4))) (or (and (= ULTIMATE.start_main_~n~0.offset ULTIMATE.start_main_~tail~0.offset) (= ULTIMATE.start_main_~n~0.base |ULTIMATE.start_main_~#list~0.base|)) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) (+ ULTIMATE.start_main_~n~0.offset 4))))))) (.cse21 (not (= ULTIMATE.start_main_~x~0.base 0)))) (or (let ((.cse0 (not (= ULTIMATE.start_main_~x~0.base .cse10)))) (and .cse0 (and (let ((.cse12 (select .cse18 ULTIMATE.start_main_~n~0.offset))) (let ((.cse5 (= ULTIMATE.start_main_~n~0.base |ULTIMATE.start_main_~#list~0.base|)) (.cse6 (= 0 .cse12))) (let ((.cse2 (let ((.cse9 (let ((.cse16 (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|))) (or (and .cse0 .cse16) (and (= 0 ULTIMATE.start_main_~n~0.offset) .cse6 .cse16 .cse7 (= (select .cse17 4) ULTIMATE.start_main_~n~0.base)))))) (or (and .cse9 (= .cse10 0)) (and (= ULTIMATE.start_main_~n~0.base .cse10) (= ULTIMATE.start_main_~n~0.offset .cse11) .cse9 (= .cse12 |ULTIMATE.start_main_~#list~0.offset|) .cse7 .cse13 (or .cse5 (= 0 (select .cse14 .cse15))))))) (.cse4 (= 0 ULTIMATE.start_main_~tail~0.offset))) (or (and .cse1 .cse2 (not (= ULTIMATE.start_main_~x~0.base .cse3)) .cse4) (and .cse2 (or .cse5 .cse6) (= ULTIMATE.start_main_~n~0.offset |ULTIMATE.start_main_~#list~0.offset|) .cse7 .cse8 .cse4))))) .cse19 .cse20 .cse21) .cse22 .cse23)) (and .cse20 (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base)) (<= (+ ULTIMATE.start_main_~x~0.base 2) |ULTIMATE.start_main_~#list~0.base|) .cse19 (= ULTIMATE.start_main_~n~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~tail~0.base) (+ ULTIMATE.start_main_~tail~0.offset 4))) .cse22 (= .cse3 |ULTIMATE.start_main_~#list~0.base|) .cse1 (= 0 |ULTIMATE.start_main_~#list~0.offset|) (<= (+ .cse10 2) |ULTIMATE.start_main_~#list~0.base|) .cse23 .cse13 (not (= 0 .cse3)) (= ULTIMATE.start_main_~n~0.offset (select .cse24 4)) (not (= ULTIMATE.start_main_~n~0.base 0)) (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1) (= (select (select |#memory_$Pointer$.offset| .cse10) 0) |ULTIMATE.start_main_~#list~0.offset|) .cse7 .cse8 .cse21))))) (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0.base|)) [2019-11-20 05:40:41,880 INFO L440 ceAbstractionStarter]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse5 (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1)) (.cse0 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset)) (.cse3 (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base)) (.cse4 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0.base|))) (or (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) (+ |ULTIMATE.start_main_~#list~0.offset| 4)))) (and (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base)) (= ULTIMATE.start_main_~n~0.base (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~tail~0.base) (+ ULTIMATE.start_main_~tail~0.offset 4))) .cse0 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base) 0) 0) (= 0 |ULTIMATE.start_main_~#list~0.offset|) (let ((.cse1 (select |#memory_$Pointer$.base| .cse2))) (and (= (select .cse1 0) |ULTIMATE.start_main_~#list~0.base|) (= 0 ULTIMATE.start_main_~n~0.offset) (not (= .cse2 0)) (<= (+ ULTIMATE.start_main_~x~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (<= (+ ULTIMATE.start_main_~n~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= (select .cse1 4) 0) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base) 0) |ULTIMATE.start_main_~#list~0.base|) .cse3 (not (= 0 |ULTIMATE.start_main_~#list~0.base|)))) (= ULTIMATE.start_main_~x~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) (+ ULTIMATE.start_main_~n~0.offset 4))) .cse4 (= ULTIMATE.start_main_~n~0.offset (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) 4)) .cse5 (= (select (select |#memory_$Pointer$.offset| .cse2) 0) |ULTIMATE.start_main_~#list~0.offset|) (not (= ULTIMATE.start_main_~x~0.base 0)))) (and .cse5 .cse0 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|) .cse3 (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|) .cse4))) [2019-11-20 05:40:41,880 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 05:40:41,880 INFO L444 ceAbstractionStarter]: For program point L606(line 606) no Hoare annotation was computed. [2019-11-20 05:40:41,880 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 05:40:41,880 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 05:40:41,881 INFO L440 ceAbstractionStarter]: At program point L606-2(line 606) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base)) (.cse4 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base))) (and (<= (+ ULTIMATE.start_main_~n~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= ULTIMATE.start_main_~n~0.offset |ULTIMATE.start_main_~#list~0.offset|) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base) (not (= 0 |ULTIMATE.start_main_~#list~0.base|)) (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base)) (<= (+ ULTIMATE.start_main_~x~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset) (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_remove_~x.offset) (= (select .cse0 0) 0) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_remove_~x.base) (= ULTIMATE.start_main_~x~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0.base|) (= (select .cse0 (+ ULTIMATE.start_main_~x~0.offset 4)) 0) (not |ULTIMATE.start_main_#t~short21|) (exists ((v_arrayElimIndex_18 Int)) (let ((.cse3 (select |#memory_$Pointer$.offset| v_arrayElimIndex_18))) (let ((.cse2 (select .cse3 4)) (.cse1 (select |#memory_$Pointer$.base| v_arrayElimIndex_18))) (and (= (select .cse1 0) |ULTIMATE.start_main_~#list~0.base|) (= .cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (not (= |ULTIMATE.start_main_~#list~0.base| v_arrayElimIndex_18)) (= .cse2 0) (= (select .cse3 0) |ULTIMATE.start_main_~#list~0.offset|) (= 0 (select .cse1 4)))))) (not (= ULTIMATE.start_main_~n~0.base 0)) (= (select .cse4 ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_~#list~0.base|) (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) (+ (select .cse0 ULTIMATE.start_main_~x~0.offset) 4)) 0) (= |ULTIMATE.start_main_~#list~0.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (not (= ULTIMATE.start_main_~x~0.base 0)) (= (select .cse4 4) 0))) [2019-11-20 05:40:41,881 INFO L444 ceAbstractionStarter]: For program point L606-3(line 606) no Hoare annotation was computed. [2019-11-20 05:40:41,881 INFO L444 ceAbstractionStarter]: For program point L606-4(line 606) no Hoare annotation was computed. [2019-11-20 05:40:41,881 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 570) no Hoare annotation was computed. [2019-11-20 05:40:41,881 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-20 05:40:41,881 INFO L444 ceAbstractionStarter]: For program point L565(lines 565 571) no Hoare annotation was computed. [2019-11-20 05:40:41,881 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 05:40:41,881 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 575) no Hoare annotation was computed. [2019-11-20 05:40:41,881 INFO L444 ceAbstractionStarter]: For program point L574-2(lines 574 575) no Hoare annotation was computed. [2019-11-20 05:40:41,881 INFO L444 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-11-20 05:40:41,881 INFO L440 ceAbstractionStarter]: At program point L5-2(lines 4 9) the Hoare annotation is: (let ((.cse0 (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset) (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1) (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#list~0.base|)))) (or (and .cse0 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|) (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|)) (let ((.cse2 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base))) (let ((.cse1 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base)) (.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) (+ (select .cse2 ULTIMATE.start_main_~x~0.offset) 4))) (.cse7 (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (and (and (= ULTIMATE.start_main_~x~0.offset 0) (and (= 0 ULTIMATE.start_main_~n~0.offset) .cse0) (not (= ULTIMATE.start_main_~x~0.base 0))) (<= (+ ULTIMATE.start_main_~n~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base)) (<= (+ ULTIMATE.start_main_~x~0.base 2) |ULTIMATE.start_main_~#list~0.base|) (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_remove_~x.offset) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_remove_~x.base) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (not (= 0 (select .cse1 0))) (= (select .cse2 (+ ULTIMATE.start_main_~x~0.offset 4)) 0) (exists ((v_arrayElimIndex_18 Int)) (let ((.cse5 (select |#memory_$Pointer$.offset| v_arrayElimIndex_18))) (let ((.cse4 (select .cse5 4)) (.cse3 (select |#memory_$Pointer$.base| v_arrayElimIndex_18))) (and (= (select .cse3 0) |ULTIMATE.start_main_~#list~0.base|) (= .cse4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (not (= |ULTIMATE.start_main_~#list~0.base| v_arrayElimIndex_18)) (= .cse4 0) (= (select .cse5 0) |ULTIMATE.start_main_~#list~0.offset|) (= 0 (select .cse3 4)))))) (not (= ULTIMATE.start_main_~n~0.base 0)) (= (select .cse1 ULTIMATE.start_main_~x~0.offset) |ULTIMATE.start_main_~#list~0.base|) (= .cse6 (select .cse1 .cse7)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|) (= (select .cse2 |ULTIMATE.start_main_~#list~0.offset|) |ULTIMATE.start_main_~#list~0.offset|) (= .cse6 0) (= |ULTIMATE.start_main_~#list~0.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) .cse7))))))) [2019-11-20 05:40:41,882 INFO L444 ceAbstractionStarter]: For program point L5-3(lines 5 7) no Hoare annotation was computed. [2019-11-20 05:40:41,882 INFO L444 ceAbstractionStarter]: For program point L608(line 608) no Hoare annotation was computed. [2019-11-20 05:40:41,882 INFO L447 ceAbstractionStarter]: At program point L5-5(lines 4 9) the Hoare annotation is: true [2019-11-20 05:40:41,882 INFO L444 ceAbstractionStarter]: For program point L604(line 604) no Hoare annotation was computed. [2019-11-20 05:40:41,882 INFO L444 ceAbstractionStarter]: For program point L567(lines 567 568) no Hoare annotation was computed. [2019-11-20 05:40:41,882 INFO L444 ceAbstractionStarter]: For program point L567-2(lines 567 568) no Hoare annotation was computed. [2019-11-20 05:40:41,882 INFO L444 ceAbstractionStarter]: For program point L596(lines 596 597) no Hoare annotation was computed. [2019-11-20 05:40:41,882 INFO L444 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-11-20 05:40:41,882 INFO L444 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-11-20 05:40:41,882 INFO L447 ceAbstractionStarter]: At program point is_list_containing_xENTRY(lines 579 586) the Hoare annotation is: true [2019-11-20 05:40:41,883 INFO L440 ceAbstractionStarter]: At program point L584(line 584) the Hoare annotation is: (let ((.cse30 (+ |is_list_containing_x_#in~l.offset| 4))) (let ((.cse29 (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) .cse30)) (.cse28 (select (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|) .cse30))) (let ((.cse16 (or (not (= 0 .cse29)) (not (= .cse28 0)))) (.cse17 (= |is_list_containing_x_#t~mem14.offset| .cse29)) (.cse15 (= .cse28 |is_list_containing_x_#t~mem14.base|))) (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|))) (or (or (forall ((|v_ULTIMATE.start_main_~#list~0.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_17| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_~#list~0.offset_BEFORE_CALL_15| 4))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_17|) .cse3))) (let ((.cse0 (select |#memory_$Pointer$.base| .cse1)) (.cse2 (select |#memory_$Pointer$.offset| .cse1))) (or (not (= (select .cse0 0) |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_17|)) (not (<= (+ .cse1 2) |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_17|)) (not (= (select .cse2 0) |v_ULTIMATE.start_main_~#list~0.offset_BEFORE_CALL_15|)) (not (= (select .cse0 4) 0)) (not (= 0 (select .cse2 4))) (not (= 0 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_17|) .cse3)))))))) (and (forall ((|v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10| Int)) (let ((.cse4 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|) 4))) (let ((.cse5 (select |#memory_$Pointer$.offset| .cse4)) (.cse6 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|) 4))) (or (= 0 .cse4) (not (= 0 (select .cse5 (+ .cse6 4)))) (not (= (select .cse5 .cse6) 0)) (not (= (select (select |#memory_$Pointer$.base| .cse4) .cse6) |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|)) (not (= .cse4 |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|)) (not (= .cse6 0)))))) (forall ((|v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10| Int)) (let ((.cse10 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|) 4)) (.cse7 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|) 4))) (let ((.cse8 (select |#memory_$Pointer$.offset| .cse7)) (.cse11 (select |#memory_$Pointer$.base| .cse7)) (.cse9 (+ .cse10 4))) (or (= 0 .cse7) (not (= 0 (select .cse8 .cse9))) (not (= (select .cse8 .cse10) 0)) (not (= (select .cse11 .cse10) |v_ULTIMATE.start_main_~#list~0.base_BEFORE_CALL_10|)) (not (= (select .cse11 .cse9) 0)) (not (= .cse10 0))))))) (and (forall ((ULTIMATE.start_main_~tail~0.offset Int) (v_prenex_181 Int)) (let ((.cse13 (select |#memory_$Pointer$.base| v_prenex_181))) (let ((.cse12 (select .cse13 0))) (or (not (= (select (select |#memory_$Pointer$.base| .cse12) (+ ULTIMATE.start_main_~tail~0.offset 4)) v_prenex_181)) (= .cse12 0) (not (= (select .cse13 4) 0)))))) (forall ((v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12 Int)) (let ((.cse14 (select |#memory_$Pointer$.base| v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12))) (or (not (= (select .cse14 4) v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12)) (not (= v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12 (select .cse14 0))) (= 0 v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12)))))) (and .cse15 (and .cse16 .cse17))) (= |is_list_containing_x_#in~x.offset| is_list_containing_x_~x.offset) (= is_list_containing_x_~l.base |is_list_containing_x_#in~l.base|) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (or (forall ((v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_5 Int)) (let ((.cse18 (select |#memory_$Pointer$.base| v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_5))) (let ((.cse19 (select .cse18 0))) (or (not (= 0 (select .cse18 4))) (= v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_5 0) (not (= (select (select |#memory_$Pointer$.base| .cse19) 4) 0)) (= v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_5 .cse19))))) (and .cse16 .cse17 .cse15) (and (or (forall ((v_prenex_160 Int)) (let ((.cse22 (select |#memory_$Pointer$.base| v_prenex_160)) (.cse20 (select |#memory_$Pointer$.offset| v_prenex_160))) (let ((.cse23 (select .cse20 4)) (.cse21 (select .cse22 0))) (or (not (= (select .cse20 0) 0)) (= v_prenex_160 .cse21) (not (= 0 (select .cse22 4))) (not (= .cse23 0)) (not (= (select (select |#memory_$Pointer$.base| .cse21) 4) 0)) (not (= .cse23 (select (select |#memory_$Pointer$.offset| .cse21) 4))))))) (forall ((v_prenex_158 Int) (v_prenex_159 Int)) (= 0 (select (select |#memory_$Pointer$.offset| v_prenex_158) (+ v_prenex_159 4))))) (or (forall ((|v_is_list_containing_x_#in~l.base_BEFORE_CALL_6| Int) (|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_6| Int)) (= (select (select |#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_6|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_6| 4)) 0)) (forall ((v_arrayElimIndex_18 Int)) (let ((.cse27 (select |#memory_$Pointer$.offset| v_arrayElimIndex_18)) (.cse24 (select |#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse25 (select .cse24 0)) (.cse26 (select .cse27 4))) (or (not (= 0 (select .cse24 4))) (not (= 0 (select (select |#memory_$Pointer$.base| .cse25) 4))) (= .cse25 v_arrayElimIndex_18) (not (= 0 .cse26)) (not (= (select (select |#memory_$Pointer$.offset| .cse25) 4) .cse26)) (not (= 0 (select .cse27 0)))))))))) (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~l.offset))))) [2019-11-20 05:40:41,883 INFO L444 ceAbstractionStarter]: For program point L583(lines 583 584) no Hoare annotation was computed. [2019-11-20 05:40:41,883 INFO L444 ceAbstractionStarter]: For program point L584-1(line 584) no Hoare annotation was computed. [2019-11-20 05:40:41,883 INFO L444 ceAbstractionStarter]: For program point is_list_containing_xFINAL(lines 579 586) no Hoare annotation was computed. [2019-11-20 05:40:41,884 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 582) no Hoare annotation was computed. [2019-11-20 05:40:41,884 INFO L444 ceAbstractionStarter]: For program point is_list_containing_xEXIT(lines 579 586) no Hoare annotation was computed. [2019-11-20 05:40:41,893 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,894 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,894 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,894 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,894 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,894 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,895 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,895 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,895 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,896 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,896 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,896 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,896 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,897 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,897 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,897 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,897 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,897 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,898 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,898 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,898 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,898 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,898 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,899 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,899 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,902 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,902 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,902 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,902 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,903 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,903 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:41,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:41,904 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,904 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,905 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,905 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,905 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,906 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,906 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,906 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,907 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,907 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,907 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,907 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,908 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,908 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:41,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:41,909 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,913 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,914 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,914 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,915 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,915 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,915 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,916 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,916 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,916 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,916 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,917 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,917 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,917 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,920 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,920 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,920 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,923 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,923 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,923 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,923 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,923 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,923 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,924 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,924 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,924 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,925 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,925 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,925 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,926 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,926 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,926 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,926 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,926 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,926 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,926 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,926 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,927 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-20 05:40:41,932 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,932 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,935 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,935 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,935 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,936 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,936 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,936 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,937 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,937 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,937 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,938 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,939 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,939 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,939 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,940 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,940 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,940 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,941 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,941 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,941 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,942 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,942 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,942 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,943 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,943 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,943 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,944 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:41,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:41,945 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,945 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,945 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,946 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,946 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,946 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,947 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,947 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,947 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,948 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,948 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,948 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,948 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,949 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:41,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:41,949 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,952 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,952 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,952 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,952 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,953 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,953 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,953 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,953 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,954 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,954 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,954 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,955 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,955 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,955 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,956 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,956 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,956 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,956 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,957 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,957 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,957 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,958 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,959 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,961 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,961 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,961 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,962 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,962 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,962 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,962 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,963 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,963 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,963 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,964 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,964 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,964 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,964 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,965 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,965 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,965 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,965 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,966 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,966 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,966 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-20 05:40:41,969 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,969 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,969 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,970 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:41,970 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:41,971 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:41,971 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:41,972 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:41,973 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:41,973 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,973 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,974 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,974 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,974 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,974 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,975 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,975 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,975 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,976 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-20 05:40:41,976 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-20 05:40:41,976 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,976 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,977 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,977 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,977 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,981 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,982 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,982 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,982 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:41,983 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:41,983 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:41,984 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:41,984 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:41,985 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:41,985 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,986 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,986 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,986 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,986 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,987 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,987 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:41,987 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,987 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:41,988 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-20 05:40:41,988 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-20 05:40:41,988 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,989 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,989 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,989 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,990 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,990 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,990 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,990 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,991 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,991 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,991 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,991 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,992 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,992 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,992 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,992 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,992 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,993 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:41,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:40:41 BoogieIcfgContainer [2019-11-20 05:40:41,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:40:41,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:40:41,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:40:41,996 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:40:41,996 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:34:41" (3/4) ... [2019-11-20 05:40:41,999 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 05:40:42,005 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_list_containing_x [2019-11-20 05:40:42,010 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-20 05:40:42,011 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 05:40:42,011 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 05:40:42,034 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(x == #memory_$Pointer$[list][list + 4]) && ((((((#memory_$Pointer$[x][0] == 0 && ((((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n)) && #memory_$Pointer$[list][list + 4] == 0) || ((((((n == #memory_$Pointer$[list][list + 4] && n == #memory_$Pointer$[list][list + 4]) && ((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n))) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[n][n] == list) && 0 == #memory_$Pointer$[n][n + 4]) && (n == list || 0 == #memory_$Pointer$[n][n + 4])))) && !(x == #memory_$Pointer$[x][0])) && 0 == tail) || (((((((((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n)) && #memory_$Pointer$[list][list + 4] == 0) || ((((((n == #memory_$Pointer$[list][list + 4] && n == #memory_$Pointer$[list][list + 4]) && ((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n))) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[n][n] == list) && 0 == #memory_$Pointer$[n][n + 4]) && (n == list || 0 == #memory_$Pointer$[n][n + 4]))) && (n == list || 0 == #memory_$Pointer$[n][n])) && n == list) && #memory_$Pointer$[n][n] == list) && (\exists ULTIMATE.start_main_~tail~0.offset : int :: n == #memory_$Pointer$[list][ULTIMATE.start_main_~tail~0.offset + 4] && ((n == ULTIMATE.start_main_~tail~0.offset && n == list) || 0 == #memory_$Pointer$[n][n + 4]))) && 0 == tail)) && 0 == #memory_$Pointer$[list][list + 4]) && x == list) && !(x == 0)) && list == tail) && \valid[x] == 1) || (((((((((((((((((((x == list && 1 == \valid[n]) && x + 2 <= list) && 0 == #memory_$Pointer$[list][list + 4]) && n == #memory_$Pointer$[tail][tail + 4]) && list == tail) && #memory_$Pointer$[x][0] == list) && #memory_$Pointer$[x][0] == 0) && 0 == list) && #memory_$Pointer$[list][list + 4] + 2 <= list) && \valid[x] == 1) && 0 == #memory_$Pointer$[n][n + 4]) && !(0 == #memory_$Pointer$[x][0])) && n == #memory_$Pointer$[list][4]) && !(n == 0)) && \valid[list] == 1) && #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][0] == list) && #memory_$Pointer$[n][n] == list) && (\exists ULTIMATE.start_main_~tail~0.offset : int :: n == #memory_$Pointer$[list][ULTIMATE.start_main_~tail~0.offset + 4] && ((n == ULTIMATE.start_main_~tail~0.offset && n == list) || 0 == #memory_$Pointer$[n][n + 4]))) && !(x == 0))) && list == tail) && unknown-#StackHeapBarrier-unknown < list [2019-11-20 05:40:42,035 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == cond) && list == tail) && \valid[list] == 1) && list == tail) && unknown-#StackHeapBarrier-unknown < list) && x == list) && x == list) || (((((((((((((((((((x == 0 && 0 == n && (((!(0 == cond) && list == tail) && \valid[list] == 1) && list == tail) && unknown-#StackHeapBarrier-unknown < list) && !(x == 0)) && n + 2 <= list) && 0 == #memory_$Pointer$[n][n]) && 1 == \valid[n]) && x + 2 <= list) && list == x) && x == x) && \valid[x] == 1) && !(0 == #memory_$Pointer$[x][0])) && #memory_$Pointer$[x][x + 4] == 0) && (\exists v_arrayElimIndex_18 : int :: ((((#memory_$Pointer$[v_arrayElimIndex_18][0] == list && #memory_$Pointer$[v_arrayElimIndex_18][4] == #memory_$Pointer$[list][list + 4]) && !(list == v_arrayElimIndex_18)) && #memory_$Pointer$[v_arrayElimIndex_18][4] == 0) && #memory_$Pointer$[v_arrayElimIndex_18][0] == list) && 0 == #memory_$Pointer$[v_arrayElimIndex_18][4])) && !(n == 0)) && #memory_$Pointer$[x][x] == list) && #memory_$Pointer$[list][#memory_$Pointer$[x][x] + 4] == #memory_$Pointer$[x][list + 4]) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[x][list] == list) && #memory_$Pointer$[list][#memory_$Pointer$[x][x] + 4] == 0) && list == #memory_$Pointer$[list][list + 4]) [2019-11-20 05:40:42,052 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8bc22e43-2206-492c-90df-5b17e92bc4d4/bin/uautomizer/witness.graphml [2019-11-20 05:40:42,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:40:42,053 INFO L168 Benchmark]: Toolchain (without parser) took 361733.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 946.1 MB in the beginning and 961.5 MB in the end (delta: -15.5 MB). Peak memory consumption was 169.1 MB. Max. memory is 11.5 GB. [2019-11-20 05:40:42,053 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:40:42,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 551.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -141.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:40:42,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:40:42,054 INFO L168 Benchmark]: Boogie Preprocessor took 29.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:40:42,054 INFO L168 Benchmark]: RCFGBuilder took 435.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-11-20 05:40:42,055 INFO L168 Benchmark]: TraceAbstraction took 360596.43 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 964.3 MB in the end (delta: 93.6 MB). Peak memory consumption was 387.2 MB. Max. memory is 11.5 GB. [2019-11-20 05:40:42,055 INFO L168 Benchmark]: Witness Printer took 56.82 ms. Allocated memory is still 1.2 GB. Free memory was 964.3 MB in the beginning and 961.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:40:42,057 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 551.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -141.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 435.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 360596.43 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 964.3 MB in the end (delta: 93.6 MB). Peak memory consumption was 387.2 MB. Max. memory is 11.5 GB. * Witness Printer took 56.82 ms. Allocated memory is still 1.2 GB. Free memory was 964.3 MB in the beginning and 961.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_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 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_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 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_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 Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,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$.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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,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$.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 * 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 #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - 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 - 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 2 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 593]: Loop Invariant [2019-11-20 05:40:42,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,089 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,089 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,089 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,089 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,091 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,091 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,091 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,091 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:42,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:42,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:42,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:42,102 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,103 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,104 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,105 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,106 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,107 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,108 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,110 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,110 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,110 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,113 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-20 05:40:42,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,124 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,124 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,124 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,124 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,125 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,125 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,125 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,126 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,126 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,126 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:42,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:42,128 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,128 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,129 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,129 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,129 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,129 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:42,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~tail~0.offset,QUANTIFIED] [2019-11-20 05:40:42,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,135 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,136 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,137 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,138 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,139 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,140 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,142 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((!(x == #memory_$Pointer$[list][list + 4]) && ((((((#memory_$Pointer$[x][0] == 0 && ((((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n)) && #memory_$Pointer$[list][list + 4] == 0) || ((((((n == #memory_$Pointer$[list][list + 4] && n == #memory_$Pointer$[list][list + 4]) && ((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n))) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[n][n] == list) && 0 == #memory_$Pointer$[n][n + 4]) && (n == list || 0 == #memory_$Pointer$[n][n + 4])))) && !(x == #memory_$Pointer$[x][0])) && 0 == tail) || (((((((((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n)) && #memory_$Pointer$[list][list + 4] == 0) || ((((((n == #memory_$Pointer$[list][list + 4] && n == #memory_$Pointer$[list][list + 4]) && ((!(x == #memory_$Pointer$[list][list + 4]) && x == list) || ((((0 == n && 0 == #memory_$Pointer$[n][n]) && x == list) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[list][4] == n))) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[n][n] == list) && 0 == #memory_$Pointer$[n][n + 4]) && (n == list || 0 == #memory_$Pointer$[n][n + 4]))) && (n == list || 0 == #memory_$Pointer$[n][n])) && n == list) && #memory_$Pointer$[n][n] == list) && (\exists ULTIMATE.start_main_~tail~0.offset : int :: n == #memory_$Pointer$[list][ULTIMATE.start_main_~tail~0.offset + 4] && ((n == ULTIMATE.start_main_~tail~0.offset && n == list) || 0 == #memory_$Pointer$[n][n + 4]))) && 0 == tail)) && 0 == #memory_$Pointer$[list][list + 4]) && x == list) && !(x == 0)) && list == tail) && \valid[x] == 1) || (((((((((((((((((((x == list && 1 == \valid[n]) && x + 2 <= list) && 0 == #memory_$Pointer$[list][list + 4]) && n == #memory_$Pointer$[tail][tail + 4]) && list == tail) && #memory_$Pointer$[x][0] == list) && #memory_$Pointer$[x][0] == 0) && 0 == list) && #memory_$Pointer$[list][list + 4] + 2 <= list) && \valid[x] == 1) && 0 == #memory_$Pointer$[n][n + 4]) && !(0 == #memory_$Pointer$[x][0])) && n == #memory_$Pointer$[list][4]) && !(n == 0)) && \valid[list] == 1) && #memory_$Pointer$[#memory_$Pointer$[list][list + 4]][0] == list) && #memory_$Pointer$[n][n] == list) && (\exists ULTIMATE.start_main_~tail~0.offset : int :: n == #memory_$Pointer$[list][ULTIMATE.start_main_~tail~0.offset + 4] && ((n == ULTIMATE.start_main_~tail~0.offset && n == list) || 0 == #memory_$Pointer$[n][n + 4]))) && !(x == 0))) && list == tail) && unknown-#StackHeapBarrier-unknown < list - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant [2019-11-20 05:40:42,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:42,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,149 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:42,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:42,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:42,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:42,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:42,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,152 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,152 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,152 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,152 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,153 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-20 05:40:42,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-20 05:40:42,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,154 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,155 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,155 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,155 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,155 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,156 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,156 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,156 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,156 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,156 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,159 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:42,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:42,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,160 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:42,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:42,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,161 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:42,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,162 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimIndex_18,QUANTIFIED] [2019-11-20 05:40:42,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 05:40:42,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 05:40:42,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-20 05:40:42,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-20 05:40:42,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 05:40:42,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((!(0 == cond) && list == tail) && \valid[list] == 1) && list == tail) && unknown-#StackHeapBarrier-unknown < list) && x == list) && x == list) || (((((((((((((((((((x == 0 && 0 == n && (((!(0 == cond) && list == tail) && \valid[list] == 1) && list == tail) && unknown-#StackHeapBarrier-unknown < list) && !(x == 0)) && n + 2 <= list) && 0 == #memory_$Pointer$[n][n]) && 1 == \valid[n]) && x + 2 <= list) && list == x) && x == x) && \valid[x] == 1) && !(0 == #memory_$Pointer$[x][0])) && #memory_$Pointer$[x][x + 4] == 0) && (\exists v_arrayElimIndex_18 : int :: ((((#memory_$Pointer$[v_arrayElimIndex_18][0] == list && #memory_$Pointer$[v_arrayElimIndex_18][4] == #memory_$Pointer$[list][list + 4]) && !(list == v_arrayElimIndex_18)) && #memory_$Pointer$[v_arrayElimIndex_18][4] == 0) && #memory_$Pointer$[v_arrayElimIndex_18][0] == list) && 0 == #memory_$Pointer$[v_arrayElimIndex_18][4])) && !(n == 0)) && #memory_$Pointer$[x][x] == list) && #memory_$Pointer$[list][#memory_$Pointer$[x][x] + 4] == #memory_$Pointer$[x][list + 4]) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[x][list] == list) && #memory_$Pointer$[list][#memory_$Pointer$[x][x] + 4] == 0) && list == #memory_$Pointer$[list][list + 4]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 2 error locations. Result: SAFE, OverallTime: 360.4s, OverallIterations: 23, TraceHistogramMax: 6, AutomataDifference: 234.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 77.2s, HoareTripleCheckerStatistics: 983 SDtfs, 2727 SDslu, 6106 SDs, 0 SdLazy, 7475 SolverSat, 1205 SolverUnsat, 60 SolverUnknown, 0 SolverNotchecked, 129.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1318 GetRequests, 615 SyntacticMatches, 68 SemanticMatches, 635 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8163 ImplicationChecksByTransitivity, 131.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 553 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 195 PreInvPairs, 215 NumberOfFragments, 1892 HoareAnnotationTreeSize, 195 FomulaSimplifications, 2764122 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 9 FomulaSimplificationsInter, 191663 FormulaSimplificationTreeSizeReductionInter, 76.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 43.1s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1518 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1484 ConstructedInterpolants, 247 QuantifiedInterpolants, 2429698 SizeOfPredicates, 270 NumberOfNonLiveVariables, 3150 ConjunctsInSsa, 704 ConjunctsInUnsatCore, 37 InterpolantComputations, 9 PerfectInterpolantSequences, 705/1142 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: 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...