./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-cad4683 [2019-11-15 23:08:59,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:08:59,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:08:59,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:08:59,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:08:59,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:08:59,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:08:59,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:08:59,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:08:59,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:08:59,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:08:59,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:08:59,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:08:59,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:08:59,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:08:59,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:08:59,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:08:59,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:08:59,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:08:59,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:08:59,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:08:59,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:08:59,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:08:59,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:08:59,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:08:59,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:08:59,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:08:59,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:08:59,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:08:59,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:08:59,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:08:59,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:08:59,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:08:59,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:08:59,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:08:59,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:08:59,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:08:59,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:08:59,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:08:59,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:08:59,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:08:59,224 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:08:59,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:08:59,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:08:59,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:08:59,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:08:59,238 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:08:59,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:08:59,238 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:08:59,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:08:59,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:08:59,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:08:59,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:08:59,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:08:59,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:08:59,240 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:08:59,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:08:59,240 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:08:59,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:08:59,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:08:59,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:08:59,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:08:59,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:08:59,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:08:59,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:08:59,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:08:59,242 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:08:59,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:08:59,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:08:59,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:08:59,243 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_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:08:59,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:08:59,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:08:59,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:08:59,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:08:59,281 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:08:59,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/bin/uautomizer/../../sv-benchmarks/c/heap-manipulation/dancing.i [2019-11-15 23:08:59,340 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/bin/uautomizer/data/2904dd62b/22a4f4983e07495ba9f234e0948bdf89/FLAG97f5ffb67 [2019-11-15 23:08:59,780 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:08:59,781 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/sv-benchmarks/c/heap-manipulation/dancing.i [2019-11-15 23:08:59,791 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/bin/uautomizer/data/2904dd62b/22a4f4983e07495ba9f234e0948bdf89/FLAG97f5ffb67 [2019-11-15 23:08:59,804 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/bin/uautomizer/data/2904dd62b/22a4f4983e07495ba9f234e0948bdf89 [2019-11-15 23:08:59,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:08:59,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:08:59,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:08:59,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:08:59,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:08:59,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:08:59" (1/1) ... [2019-11-15 23:08:59,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5786a32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:08:59, skipping insertion in model container [2019-11-15 23:08:59,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:08:59" (1/1) ... [2019-11-15 23:08:59,822 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:08:59,870 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:09:00,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:09:00,229 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:09:00,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:09:00,313 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:09:00,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:00 WrapperNode [2019-11-15 23:09:00,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:09:00,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:09:00,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:09:00,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:09:00,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:00" (1/1) ... [2019-11-15 23:09:00,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:00" (1/1) ... [2019-11-15 23:09:00,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:09:00,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:09:00,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:09:00,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:09:00,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:00" (1/1) ... [2019-11-15 23:09:00,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:00" (1/1) ... [2019-11-15 23:09:00,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:00" (1/1) ... [2019-11-15 23:09:00,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:00" (1/1) ... [2019-11-15 23:09:00,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:00" (1/1) ... [2019-11-15 23:09:00,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:00" (1/1) ... [2019-11-15 23:09:00,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:00" (1/1) ... [2019-11-15 23:09:00,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:09:00,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:09:00,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:09:00,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:09:00,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:09:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2019-11-15 23:09:00,448 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2019-11-15 23:09:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:09:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:09:00,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:09:00,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:09:00,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:09:00,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:09:00,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:09:00,831 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:09:00,831 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-15 23:09:00,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:09:00 BoogieIcfgContainer [2019-11-15 23:09:00,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:09:00,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:09:00,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:09:00,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:09:00,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:08:59" (1/3) ... [2019-11-15 23:09:00,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36159136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:09:00, skipping insertion in model container [2019-11-15 23:09:00,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:09:00" (2/3) ... [2019-11-15 23:09:00,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36159136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:09:00, skipping insertion in model container [2019-11-15 23:09:00,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:09:00" (3/3) ... [2019-11-15 23:09:00,842 INFO L109 eAbstractionObserver]: Analyzing ICFG dancing.i [2019-11-15 23:09:00,851 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:09:00,861 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-15 23:09:00,872 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-15 23:09:00,891 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:09:00,892 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:09:00,892 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:09:00,892 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:09:00,892 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:09:00,892 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:09:00,892 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:09:00,892 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:09:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-11-15 23:09:00,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:09:00,911 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:00,912 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:09:00,914 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:00,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash -390992366, now seen corresponding path program 1 times [2019-11-15 23:09:00,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:00,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958052314] [2019-11-15 23:09:00,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:00,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:00,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:01,046 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-15 23:09:01,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958052314] [2019-11-15 23:09:01,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:09:01,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:09:01,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581254791] [2019-11-15 23:09:01,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:09:01,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:01,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:09:01,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:09:01,062 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-11-15 23:09:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:01,080 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2019-11-15 23:09:01,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:09:01,081 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-11-15 23:09:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:01,088 INFO L225 Difference]: With dead ends: 71 [2019-11-15 23:09:01,089 INFO L226 Difference]: Without dead ends: 34 [2019-11-15 23:09:01,091 INFO L600 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-15 23:09:01,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-15 23:09:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-15 23:09:01,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 23:09:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2019-11-15 23:09:01,128 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 17 [2019-11-15 23:09:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:01,128 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2019-11-15 23:09:01,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:09:01,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2019-11-15 23:09:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:09:01,130 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:01,130 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:09:01,131 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:01,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:01,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1529433021, now seen corresponding path program 1 times [2019-11-15 23:09:01,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:01,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868804317] [2019-11-15 23:09:01,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:01,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:01,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:01,240 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-15 23:09:01,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868804317] [2019-11-15 23:09:01,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:09:01,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:09:01,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389436121] [2019-11-15 23:09:01,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:09:01,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:01,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:09:01,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:09:01,248 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand 4 states. [2019-11-15 23:09:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:01,297 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-11-15 23:09:01,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:09:01,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-15 23:09:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:01,299 INFO L225 Difference]: With dead ends: 39 [2019-11-15 23:09:01,299 INFO L226 Difference]: Without dead ends: 37 [2019-11-15 23:09:01,299 INFO L600 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-15 23:09:01,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-15 23:09:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-11-15 23:09:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 23:09:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2019-11-15 23:09:01,306 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 17 [2019-11-15 23:09:01,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:01,309 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2019-11-15 23:09:01,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:09:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2019-11-15 23:09:01,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:09:01,312 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:01,312 INFO L380 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-15 23:09:01,313 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:01,313 INFO L82 PathProgramCache]: Analyzing trace with hash -670941087, now seen corresponding path program 1 times [2019-11-15 23:09:01,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:01,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653072022] [2019-11-15 23:09:01,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:01,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:01,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:01,398 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-15 23:09:01,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653072022] [2019-11-15 23:09:01,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:09:01,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:09:01,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872657251] [2019-11-15 23:09:01,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:09:01,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:01,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:09:01,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:09:01,408 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand 4 states. [2019-11-15 23:09:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:01,479 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2019-11-15 23:09:01,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:09:01,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-15 23:09:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:01,481 INFO L225 Difference]: With dead ends: 80 [2019-11-15 23:09:01,481 INFO L226 Difference]: Without dead ends: 58 [2019-11-15 23:09:01,482 INFO L600 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-15 23:09:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-15 23:09:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-11-15 23:09:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-15 23:09:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2019-11-15 23:09:01,490 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 23 [2019-11-15 23:09:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:01,490 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2019-11-15 23:09:01,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:09:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2019-11-15 23:09:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:09:01,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:01,492 INFO L380 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-15 23:09:01,493 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:01,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2084669319, now seen corresponding path program 1 times [2019-11-15 23:09:01,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:01,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053768338] [2019-11-15 23:09:01,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:01,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:01,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:01,607 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-15 23:09:01,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053768338] [2019-11-15 23:09:01,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114315069] [2019-11-15 23:09:01,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:09:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:01,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:09:01,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:09:01,818 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-15 23:09:01,819 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:09:01,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-15 23:09:01,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129569205] [2019-11-15 23:09:01,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:09:01,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:01,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:09:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:09:01,821 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand 12 states. [2019-11-15 23:09:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:02,158 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2019-11-15 23:09:02,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:09:02,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-15 23:09:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:02,162 INFO L225 Difference]: With dead ends: 108 [2019-11-15 23:09:02,162 INFO L226 Difference]: Without dead ends: 78 [2019-11-15 23:09:02,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:09:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-15 23:09:02,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 55. [2019-11-15 23:09:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-15 23:09:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2019-11-15 23:09:02,175 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 26 [2019-11-15 23:09:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:02,175 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2019-11-15 23:09:02,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:09:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2019-11-15 23:09:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:09:02,177 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:02,178 INFO L380 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-15 23:09:02,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:09:02,382 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:02,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:02,382 INFO L82 PathProgramCache]: Analyzing trace with hash -155348295, now seen corresponding path program 1 times [2019-11-15 23:09:02,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:02,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213495891] [2019-11-15 23:09:02,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:02,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:02,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:02,481 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-15 23:09:02,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213495891] [2019-11-15 23:09:02,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:09:02,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:09:02,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461176504] [2019-11-15 23:09:02,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:09:02,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:02,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:09:02,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:09:02,483 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 5 states. [2019-11-15 23:09:02,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:02,523 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2019-11-15 23:09:02,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:09:02,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-15 23:09:02,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:02,525 INFO L225 Difference]: With dead ends: 59 [2019-11-15 23:09:02,525 INFO L226 Difference]: Without dead ends: 55 [2019-11-15 23:09:02,526 INFO L600 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-15 23:09:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-15 23:09:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2019-11-15 23:09:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-15 23:09:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2019-11-15 23:09:02,540 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 28 [2019-11-15 23:09:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:02,541 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2019-11-15 23:09:02,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:09:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2019-11-15 23:09:02,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:09:02,545 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:02,545 INFO L380 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-15 23:09:02,545 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:02,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:02,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1907184921, now seen corresponding path program 1 times [2019-11-15 23:09:02,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:02,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858568675] [2019-11-15 23:09:02,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:02,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:02,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:02,634 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-15 23:09:02,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858568675] [2019-11-15 23:09:02,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462955121] [2019-11-15 23:09:02,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:09:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:02,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-15 23:09:02,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:09:02,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:02,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:02,823 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 26 [2019-11-15 23:09:02,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:02,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:02,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:02,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:02,866 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 26 [2019-11-15 23:09:02,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:02,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:02,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:09:02,898 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:66 [2019-11-15 23:09:03,230 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:03,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 88 treesize of output 102 [2019-11-15 23:09:03,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:03,276 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:09:03,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:03,278 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-15 23:09:03,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:127, output treesize:1 [2019-11-15 23:09:03,285 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-15 23:09:03,286 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:09:03,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 12 [2019-11-15 23:09:03,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534270646] [2019-11-15 23:09:03,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:09:03,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:03,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:09:03,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:09:03,288 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand 12 states. [2019-11-15 23:09:03,552 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-11-15 23:09:04,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:04,650 INFO L93 Difference]: Finished difference Result 232 states and 326 transitions. [2019-11-15 23:09:04,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:09:04,651 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-15 23:09:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:04,655 INFO L225 Difference]: With dead ends: 232 [2019-11-15 23:09:04,655 INFO L226 Difference]: Without dead ends: 190 [2019-11-15 23:09:04,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:09:04,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-15 23:09:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 112. [2019-11-15 23:09:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 23:09:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 165 transitions. [2019-11-15 23:09:04,689 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 165 transitions. Word has length 28 [2019-11-15 23:09:04,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:04,689 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 165 transitions. [2019-11-15 23:09:04,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:09:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 165 transitions. [2019-11-15 23:09:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:09:04,692 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:04,692 INFO L380 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-15 23:09:04,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:09:04,895 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:04,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:04,896 INFO L82 PathProgramCache]: Analyzing trace with hash 333454003, now seen corresponding path program 1 times [2019-11-15 23:09:04,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:04,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143292316] [2019-11-15 23:09:04,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:04,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:04,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:04,976 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-15 23:09:04,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143292316] [2019-11-15 23:09:04,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:09:04,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:09:04,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674888143] [2019-11-15 23:09:04,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:09:04,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:04,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:09:04,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:09:04,978 INFO L87 Difference]: Start difference. First operand 112 states and 165 transitions. Second operand 5 states. [2019-11-15 23:09:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:05,071 INFO L93 Difference]: Finished difference Result 198 states and 282 transitions. [2019-11-15 23:09:05,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:09:05,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-15 23:09:05,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:05,074 INFO L225 Difference]: With dead ends: 198 [2019-11-15 23:09:05,074 INFO L226 Difference]: Without dead ends: 91 [2019-11-15 23:09:05,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-15 23:09:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-15 23:09:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2019-11-15 23:09:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-15 23:09:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2019-11-15 23:09:05,090 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 29 [2019-11-15 23:09:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:05,090 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2019-11-15 23:09:05,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:09:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2019-11-15 23:09:05,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:09:05,092 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:05,092 INFO L380 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-15 23:09:05,093 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:05,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:05,093 INFO L82 PathProgramCache]: Analyzing trace with hash 637156592, now seen corresponding path program 1 times [2019-11-15 23:09:05,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:05,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328636256] [2019-11-15 23:09:05,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:05,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:05,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:05,149 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-15 23:09:05,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328636256] [2019-11-15 23:09:05,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:09:05,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:09:05,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077147196] [2019-11-15 23:09:05,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:09:05,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:05,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:09:05,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:09:05,151 INFO L87 Difference]: Start difference. First operand 87 states and 122 transitions. Second operand 6 states. [2019-11-15 23:09:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:05,233 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2019-11-15 23:09:05,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:09:05,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-15 23:09:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:05,236 INFO L225 Difference]: With dead ends: 102 [2019-11-15 23:09:05,236 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 23:09:05,236 INFO L600 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-15 23:09:05,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 23:09:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2019-11-15 23:09:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-15 23:09:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2019-11-15 23:09:05,263 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 34 [2019-11-15 23:09:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:05,263 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2019-11-15 23:09:05,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:09:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2019-11-15 23:09:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 23:09:05,270 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:05,271 INFO L380 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-15 23:09:05,271 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:05,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:05,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1092905979, now seen corresponding path program 1 times [2019-11-15 23:09:05,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:05,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740117818] [2019-11-15 23:09:05,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:05,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:05,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:05,594 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-15 23:09:05,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740117818] [2019-11-15 23:09:05,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536066782] [2019-11-15 23:09:05,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:09:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:05,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 23:09:05,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:09:05,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:05,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:05,766 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 26 [2019-11-15 23:09:05,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:05,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:05,780 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-15 23:09:05,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:43 [2019-11-15 23:09:06,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:06,016 INFO L375 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 45 treesize of output 50 [2019-11-15 23:09:06,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:06,030 INFO L567 ElimStorePlain]: treesize reduction 28, result has 26.3 percent of original size [2019-11-15 23:09:06,030 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-15 23:09:06,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:4 [2019-11-15 23:09:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:09:06,054 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:09:06,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-15 23:09:06,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113490286] [2019-11-15 23:09:06,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:09:06,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:06,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:09:06,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:09:06,056 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand 18 states. [2019-11-15 23:09:07,101 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-11-15 23:09:07,315 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-11-15 23:09:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:08,603 INFO L93 Difference]: Finished difference Result 235 states and 323 transitions. [2019-11-15 23:09:08,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 23:09:08,603 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2019-11-15 23:09:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:08,605 INFO L225 Difference]: With dead ends: 235 [2019-11-15 23:09:08,605 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 23:09:08,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 23:09:08,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 23:09:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 58. [2019-11-15 23:09:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 23:09:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2019-11-15 23:09:08,621 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 40 [2019-11-15 23:09:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:08,622 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2019-11-15 23:09:08,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:09:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2019-11-15 23:09:08,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 23:09:08,623 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:08,623 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:09:08,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:09:08,827 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:08,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:08,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1745772944, now seen corresponding path program 1 times [2019-11-15 23:09:08,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:08,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296507001] [2019-11-15 23:09:08,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:08,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:08,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:09:08,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296507001] [2019-11-15 23:09:08,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605959502] [2019-11-15 23:09:08,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:09:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:09,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:09:09,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:09:09,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:09:09,109 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:09:09,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2019-11-15 23:09:09,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913344244] [2019-11-15 23:09:09,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:09:09,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:09,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:09:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:09:09,111 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand 12 states. [2019-11-15 23:09:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:09,305 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2019-11-15 23:09:09,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:09:09,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-11-15 23:09:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:09,306 INFO L225 Difference]: With dead ends: 89 [2019-11-15 23:09:09,306 INFO L226 Difference]: Without dead ends: 65 [2019-11-15 23:09:09,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:09:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-15 23:09:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2019-11-15 23:09:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-15 23:09:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2019-11-15 23:09:09,319 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 42 [2019-11-15 23:09:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:09,319 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2019-11-15 23:09:09,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:09:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2019-11-15 23:09:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 23:09:09,320 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:09,320 INFO L380 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-15 23:09:09,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:09:09,531 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:09,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1513117575, now seen corresponding path program 1 times [2019-11-15 23:09:09,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:09,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127015188] [2019-11-15 23:09:09,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:09,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:09,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:10,445 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-15 23:09:10,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127015188] [2019-11-15 23:09:10,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137047033] [2019-11-15 23:09:10,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:09:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:10,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-15 23:09:10,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:09:10,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:10,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:10,609 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 26 [2019-11-15 23:09:10,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:10,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:10,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:10,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:10,636 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 26 [2019-11-15 23:09:10,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:10,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:10,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:09:10,654 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:66 [2019-11-15 23:09:11,077 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_24|], 10=[|v_#memory_$Pointer$.base_25|]} [2019-11-15 23:09:11,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:11,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2019-11-15 23:09:11,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:11,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:11,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:11,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:11,104 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:11,144 INFO L341 Elim1Store]: treesize reduction 16, result has 68.6 percent of original size [2019-11-15 23:09:11,144 INFO L375 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 2 case distinctions, treesize of input 49 treesize of output 63 [2019-11-15 23:09:11,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:11,165 INFO L567 ElimStorePlain]: treesize reduction 39, result has 53.0 percent of original size [2019-11-15 23:09:11,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:09:11,165 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:44 [2019-11-15 23:09:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:09:11,518 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:09:11,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2019-11-15 23:09:11,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867522456] [2019-11-15 23:09:11,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 23:09:11,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:11,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 23:09:11,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 23:09:11,520 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand 34 states. [2019-11-15 23:09:11,927 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-15 23:09:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:16,087 INFO L93 Difference]: Finished difference Result 224 states and 293 transitions. [2019-11-15 23:09:16,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-11-15 23:09:16,087 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2019-11-15 23:09:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:16,089 INFO L225 Difference]: With dead ends: 224 [2019-11-15 23:09:16,089 INFO L226 Difference]: Without dead ends: 195 [2019-11-15 23:09:16,092 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1641 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=709, Invalid=5611, Unknown=0, NotChecked=0, Total=6320 [2019-11-15 23:09:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-15 23:09:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 125. [2019-11-15 23:09:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 23:09:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 169 transitions. [2019-11-15 23:09:16,132 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 169 transitions. Word has length 40 [2019-11-15 23:09:16,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:16,132 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 169 transitions. [2019-11-15 23:09:16,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 23:09:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 169 transitions. [2019-11-15 23:09:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:09:16,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:16,134 INFO L380 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-15 23:09:16,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:09:16,341 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:16,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1275496661, now seen corresponding path program 2 times [2019-11-15 23:09:16,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:16,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208432436] [2019-11-15 23:09:16,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:16,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:16,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,400 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-15 23:09:16,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208432436] [2019-11-15 23:09:16,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:09:16,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:09:16,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931196708] [2019-11-15 23:09:16,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:09:16,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:16,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:09:16,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:09:16,404 INFO L87 Difference]: Start difference. First operand 125 states and 169 transitions. Second operand 7 states. [2019-11-15 23:09:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:16,462 INFO L93 Difference]: Finished difference Result 154 states and 209 transitions. [2019-11-15 23:09:16,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:09:16,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-11-15 23:09:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:16,466 INFO L225 Difference]: With dead ends: 154 [2019-11-15 23:09:16,466 INFO L226 Difference]: Without dead ends: 152 [2019-11-15 23:09:16,467 INFO L600 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-15 23:09:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-15 23:09:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2019-11-15 23:09:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-15 23:09:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 184 transitions. [2019-11-15 23:09:16,497 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 184 transitions. Word has length 41 [2019-11-15 23:09:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:16,497 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 184 transitions. [2019-11-15 23:09:16,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:09:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 184 transitions. [2019-11-15 23:09:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:09:16,499 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:16,500 INFO L380 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-15 23:09:16,500 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:16,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1310398175, now seen corresponding path program 1 times [2019-11-15 23:09:16,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:16,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309181630] [2019-11-15 23:09:16,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:16,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:16,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,530 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-15 23:09:16,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309181630] [2019-11-15 23:09:16,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:09:16,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:09:16,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214909298] [2019-11-15 23:09:16,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:09:16,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:16,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:09:16,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:09:16,533 INFO L87 Difference]: Start difference. First operand 136 states and 184 transitions. Second operand 3 states. [2019-11-15 23:09:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:16,554 INFO L93 Difference]: Finished difference Result 261 states and 345 transitions. [2019-11-15 23:09:16,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:09:16,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-15 23:09:16,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:16,557 INFO L225 Difference]: With dead ends: 261 [2019-11-15 23:09:16,557 INFO L226 Difference]: Without dead ends: 136 [2019-11-15 23:09:16,558 INFO L600 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-15 23:09:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-15 23:09:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-11-15 23:09:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-15 23:09:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 177 transitions. [2019-11-15 23:09:16,575 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 177 transitions. Word has length 44 [2019-11-15 23:09:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:16,576 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 177 transitions. [2019-11-15 23:09:16,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:09:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 177 transitions. [2019-11-15 23:09:16,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:09:16,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:16,578 INFO L380 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-15 23:09:16,579 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:16,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:16,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1376186339, now seen corresponding path program 1 times [2019-11-15 23:09:16,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:16,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032248681] [2019-11-15 23:09:16,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:16,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:16,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,629 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-15 23:09:16,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032248681] [2019-11-15 23:09:16,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180452968] [2019-11-15 23:09:16,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:09:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:16,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 102 conjunts are in the unsatisfiable core [2019-11-15 23:09:16,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:09:16,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:16,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:16,790 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 26 [2019-11-15 23:09:16,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:16,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:16,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:16,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:16,836 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:16,838 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 26 [2019-11-15 23:09:16,839 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:16,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:16,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:09:16,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:72 [2019-11-15 23:09:17,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:17,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:17,064 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:17,124 INFO L341 Elim1Store]: treesize reduction 28, result has 60.0 percent of original size [2019-11-15 23:09:17,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 67 [2019-11-15 23:09:17,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:17,198 INFO L567 ElimStorePlain]: treesize reduction 20, result has 84.7 percent of original size [2019-11-15 23:09:17,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:17,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:17,207 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:17,234 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:17,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 95 [2019-11-15 23:09:17,235 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:17,302 INFO L567 ElimStorePlain]: treesize reduction 44, result has 68.1 percent of original size [2019-11-15 23:09:17,303 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-15 23:09:17,303 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:115 [2019-11-15 23:09:17,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:17,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:17,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:18,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:09:18,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:18,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:18,386 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 149 [2019-11-15 23:09:18,680 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 47 [2019-11-15 23:09:18,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:18,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:18,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:18,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:18,829 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:18,838 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:18,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:18,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:18,841 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:18,887 INFO L341 Elim1Store]: treesize reduction 16, result has 77.5 percent of original size [2019-11-15 23:09:18,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 184 treesize of output 191 [2019-11-15 23:09:18,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:18,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:18,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:18,906 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:18,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:18,910 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:18,950 INFO L341 Elim1Store]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 23:09:18,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 157 treesize of output 157 [2019-11-15 23:09:18,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:19,293 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-11-15 23:09:19,293 INFO L567 ElimStorePlain]: treesize reduction 142, result has 71.4 percent of original size [2019-11-15 23:09:19,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:19,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:19,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:19,310 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:19,317 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:19,322 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:19,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:19,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 165 treesize of output 252 [2019-11-15 23:09:19,382 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:19,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:19,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:19,400 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:19,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:19,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:19,495 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:19,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 188 treesize of output 346 [2019-11-15 23:09:19,497 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:19,786 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-11-15 23:09:19,786 INFO L567 ElimStorePlain]: treesize reduction 164, result has 68.0 percent of original size [2019-11-15 23:09:19,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 23:09:19,787 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:342, output treesize:348 [2019-11-15 23:09:19,939 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-15 23:09:19,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:19,960 INFO L392 ElimStorePlain]: Different costs {11=[v_prenex_18], 14=[|v_#memory_$Pointer$.offset_28|], 21=[v_prenex_19], 26=[|v_#memory_$Pointer$.base_29|]} [2019-11-15 23:09:19,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:19,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:19,993 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:19,997 INFO L375 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 101 [2019-11-15 23:09:19,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:20,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:20,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:20,062 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:20,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 122 [2019-11-15 23:09:20,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:20,068 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 23:09:20,069 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:20,073 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-15 23:09:20,073 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:20,259 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-11-15 23:09:20,259 INFO L567 ElimStorePlain]: treesize reduction 584, result has 30.2 percent of original size [2019-11-15 23:09:20,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:20,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:20,269 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:20,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:20,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 163 treesize of output 149 [2019-11-15 23:09:20,283 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:20,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:20,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:20,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:20,339 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:20,384 INFO L341 Elim1Store]: treesize reduction 16, result has 78.7 percent of original size [2019-11-15 23:09:20,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 89 treesize of output 125 [2019-11-15 23:09:20,385 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:20,465 INFO L567 ElimStorePlain]: treesize reduction 59, result has 72.8 percent of original size [2019-11-15 23:09:20,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:20,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:20,475 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:20,557 INFO L341 Elim1Store]: treesize reduction 16, result has 86.0 percent of original size [2019-11-15 23:09:20,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 168 [2019-11-15 23:09:20,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:20,609 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:09:20,739 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2019-11-15 23:09:20,740 INFO L567 ElimStorePlain]: treesize reduction 193, result has 42.7 percent of original size [2019-11-15 23:09:20,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 23:09:20,741 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:1257, output treesize:144 [2019-11-15 23:09:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:09:21,225 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:09:21,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 23] total 26 [2019-11-15 23:09:21,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76914242] [2019-11-15 23:09:21,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 23:09:21,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:21,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 23:09:21,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2019-11-15 23:09:21,227 INFO L87 Difference]: Start difference. First operand 134 states and 177 transitions. Second operand 26 states. [2019-11-15 23:09:21,920 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-15 23:09:22,314 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-11-15 23:09:22,525 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-11-15 23:09:22,873 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 108 [2019-11-15 23:09:23,142 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 103 [2019-11-15 23:09:23,511 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-11-15 23:09:23,837 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 106 [2019-11-15 23:09:24,098 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 101 [2019-11-15 23:09:24,251 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-11-15 23:09:24,435 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-11-15 23:09:24,742 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2019-11-15 23:09:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:09:25,366 INFO L93 Difference]: Finished difference Result 269 states and 345 transitions. [2019-11-15 23:09:25,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 23:09:25,366 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2019-11-15 23:09:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:09:25,367 INFO L225 Difference]: With dead ends: 269 [2019-11-15 23:09:25,367 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 23:09:25,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=302, Invalid=2248, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 23:09:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 23:09:25,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 146. [2019-11-15 23:09:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:09:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 187 transitions. [2019-11-15 23:09:25,388 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 187 transitions. Word has length 44 [2019-11-15 23:09:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:09:25,388 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 187 transitions. [2019-11-15 23:09:25,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 23:09:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 187 transitions. [2019-11-15 23:09:25,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:09:25,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:09:25,389 INFO L380 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-15 23:09:25,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:09:25,593 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:09:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:09:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1523797054, now seen corresponding path program 2 times [2019-11-15 23:09:25,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:09:25,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303631985] [2019-11-15 23:09:25,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:25,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:09:25,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:09:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:25,924 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-11-15 23:09:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:09:26,205 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-15 23:09:26,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303631985] [2019-11-15 23:09:26,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556806731] [2019-11-15 23:09:26,206 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:09:26,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:09:26,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:09:26,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-15 23:09:26,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:09:26,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:26,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:26,378 INFO L375 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-15 23:09:26,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:26,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:26,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:26,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:26,406 INFO L375 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-15 23:09:26,407 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:26,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:26,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:09:26,426 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:62 [2019-11-15 23:09:26,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:26,719 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:09:26,787 INFO L341 Elim1Store]: treesize reduction 24, result has 78.2 percent of original size [2019-11-15 23:09:26,787 INFO L375 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 170 treesize of output 154 [2019-11-15 23:09:26,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:09:26,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:09:26,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:09:26,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:09:26,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:09:26,802 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-15 23:09:26,949 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 34 [2019-11-15 23:09:26,949 INFO L567 ElimStorePlain]: treesize reduction 117, result has 43.5 percent of original size [2019-11-15 23:09:26,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:09:26,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:26,968 INFO L375 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 75 treesize of output 89 [2019-11-15 23:09:26,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:09:26,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:09:26,988 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-15 23:09:26,988 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:182, output treesize:67 [2019-11-15 23:09:29,940 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 64 [2019-11-15 23:09:30,671 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:09:30,671 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:09:30,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-11-15 23:09:30,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223792050] [2019-11-15 23:09:30,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 23:09:30,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:09:30,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 23:09:30,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2019-11-15 23:09:30,674 INFO L87 Difference]: Start difference. First operand 146 states and 187 transitions. Second operand 27 states. [2019-11-15 23:09:31,684 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 56 [2019-11-15 23:09:31,822 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 50 [2019-11-15 23:09:49,218 WARN L191 SmtUtils]: Spent 7.14 s on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-11-15 23:09:57,348 WARN L191 SmtUtils]: Spent 6.02 s on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-11-15 23:10:04,425 WARN L191 SmtUtils]: Spent 5.00 s on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-11-15 23:10:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:10:27,564 INFO L93 Difference]: Finished difference Result 274 states and 349 transitions. [2019-11-15 23:10:27,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-15 23:10:27,564 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2019-11-15 23:10:27,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:10:27,565 INFO L225 Difference]: With dead ends: 274 [2019-11-15 23:10:27,565 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 23:10:27,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=419, Invalid=3002, Unknown=1, NotChecked=0, Total=3422 [2019-11-15 23:10:27,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 23:10:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2019-11-15 23:10:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 23:10:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2019-11-15 23:10:27,584 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 47 [2019-11-15 23:10:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:10:27,585 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2019-11-15 23:10:27,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 23:10:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2019-11-15 23:10:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:10:27,586 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:10:27,586 INFO L380 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-15 23:10:27,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:10:27,790 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:10:27,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:27,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1031600160, now seen corresponding path program 1 times [2019-11-15 23:10:27,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:27,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161047857] [2019-11-15 23:10:27,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:27,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:27,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:28,183 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-15 23:10:28,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161047857] [2019-11-15 23:10:28,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317434066] [2019-11-15 23:10:28,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:10:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:28,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-15 23:10:28,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:10:28,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:28,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:28,377 INFO L375 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-15 23:10:28,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:28,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:28,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:28,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:28,412 INFO L375 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-15 23:10:28,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:28,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:28,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:10:28,429 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:87, output treesize:65 [2019-11-15 23:10:28,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:28,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:28,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:28,678 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:10:28,679 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:10:28,691 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:28,692 INFO L375 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 115 [2019-11-15 23:10:28,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:28,731 INFO L567 ElimStorePlain]: treesize reduction 31, result has 77.7 percent of original size [2019-11-15 23:10:28,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:28,737 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:10:28,994 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-11-15 23:10:28,994 INFO L341 Elim1Store]: treesize reduction 78, result has 73.6 percent of original size [2019-11-15 23:10:28,994 INFO L375 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 105 treesize of output 280 [2019-11-15 23:10:28,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:10:28,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:28,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:28,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:28,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:28,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:29,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:29,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:29,079 INFO L567 ElimStorePlain]: treesize reduction 782, result has 9.5 percent of original size [2019-11-15 23:10:29,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:10:29,080 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:123, output treesize:81 [2019-11-15 23:10:29,232 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:29,232 INFO L375 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 2 case distinctions, treesize of input 83 treesize of output 84 [2019-11-15 23:10:29,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:29,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:29,234 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-15 23:10:29,250 INFO L567 ElimStorePlain]: treesize reduction 18, result has 71.9 percent of original size [2019-11-15 23:10:29,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:29,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-11-15 23:10:29,253 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:29,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:29,259 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-15 23:10:29,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:7 [2019-11-15 23:10:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:10:29,303 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:10:29,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-15 23:10:29,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080331594] [2019-11-15 23:10:29,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 23:10:29,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:10:29,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:10:29,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:10:29,304 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand 22 states. [2019-11-15 23:10:29,685 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-11-15 23:10:30,193 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-11-15 23:10:30,349 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-11-15 23:10:30,729 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-11-15 23:10:31,116 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-11-15 23:10:31,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:10:31,595 INFO L93 Difference]: Finished difference Result 219 states and 272 transitions. [2019-11-15 23:10:31,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 23:10:31,595 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-11-15 23:10:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:10:31,597 INFO L225 Difference]: With dead ends: 219 [2019-11-15 23:10:31,597 INFO L226 Difference]: Without dead ends: 195 [2019-11-15 23:10:31,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=332, Invalid=1474, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 23:10:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-15 23:10:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 179. [2019-11-15 23:10:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-15 23:10:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 224 transitions. [2019-11-15 23:10:31,617 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 224 transitions. Word has length 46 [2019-11-15 23:10:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:10:31,617 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 224 transitions. [2019-11-15 23:10:31,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 23:10:31,617 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 224 transitions. [2019-11-15 23:10:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:10:31,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:10:31,619 INFO L380 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-15 23:10:31,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:10:31,821 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:10:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:31,822 INFO L82 PathProgramCache]: Analyzing trace with hash -773434722, now seen corresponding path program 1 times [2019-11-15 23:10:31,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:31,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404644977] [2019-11-15 23:10:31,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:31,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:31,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 23:10:32,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404644977] [2019-11-15 23:10:32,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368195006] [2019-11-15 23:10:32,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:10:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:32,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-15 23:10:32,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:10:32,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:32,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:32,655 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 26 [2019-11-15 23:10:32,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:32,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:32,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:32,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:32,679 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 26 [2019-11-15 23:10:32,680 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:32,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:32,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:10:32,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:66 [2019-11-15 23:10:32,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:32,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:32,983 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:10:32,984 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:10:32,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:32,985 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:10:33,011 INFO L341 Elim1Store]: treesize reduction 18, result has 67.3 percent of original size [2019-11-15 23:10:33,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 92 [2019-11-15 23:10:33,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:33,056 INFO L567 ElimStorePlain]: treesize reduction 35, result has 74.6 percent of original size [2019-11-15 23:10:33,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:33,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:33,061 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:10:33,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:33,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 86 [2019-11-15 23:10:33,071 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:33,104 INFO L567 ElimStorePlain]: treesize reduction 13, result has 84.3 percent of original size [2019-11-15 23:10:33,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:10:33,105 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:70 [2019-11-15 23:10:33,306 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_35|], 10=[|v_#memory_$Pointer$.base_36|]} [2019-11-15 23:10:33,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:33,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 31 [2019-11-15 23:10:33,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:33,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:33,325 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:10:33,336 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:33,337 INFO L375 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 3 case distinctions, treesize of input 49 treesize of output 60 [2019-11-15 23:10:33,337 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:33,359 INFO L567 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-11-15 23:10:33,359 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-15 23:10:33,359 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:40 [2019-11-15 23:10:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:10:33,580 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:10:33,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-11-15 23:10:33,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40565390] [2019-11-15 23:10:33,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-15 23:10:33,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:10:33,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-15 23:10:33,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 23:10:33,582 INFO L87 Difference]: Start difference. First operand 179 states and 224 transitions. Second operand 33 states. [2019-11-15 23:10:35,518 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-11-15 23:10:35,702 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 91 [2019-11-15 23:10:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:10:37,204 INFO L93 Difference]: Finished difference Result 271 states and 341 transitions. [2019-11-15 23:10:37,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-15 23:10:37,219 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 46 [2019-11-15 23:10:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:10:37,221 INFO L225 Difference]: With dead ends: 271 [2019-11-15 23:10:37,222 INFO L226 Difference]: Without dead ends: 265 [2019-11-15 23:10:37,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=604, Invalid=4366, Unknown=0, NotChecked=0, Total=4970 [2019-11-15 23:10:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-11-15 23:10:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 222. [2019-11-15 23:10:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-15 23:10:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 283 transitions. [2019-11-15 23:10:37,249 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 283 transitions. Word has length 46 [2019-11-15 23:10:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:10:37,249 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 283 transitions. [2019-11-15 23:10:37,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-15 23:10:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 283 transitions. [2019-11-15 23:10:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:10:37,251 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:10:37,251 INFO L380 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-15 23:10:37,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:10:37,462 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:10:37,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1166461732, now seen corresponding path program 1 times [2019-11-15 23:10:37,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:37,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113721946] [2019-11-15 23:10:37,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:37,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:37,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:37,849 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-15 23:10:37,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113721946] [2019-11-15 23:10:37,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918483257] [2019-11-15 23:10:37,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:10:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:37,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 23:10:37,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:10:38,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:38,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:38,052 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 26 [2019-11-15 23:10:38,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:38,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:38,072 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-15 23:10:38,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:43 [2019-11-15 23:10:38,321 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_36|], 28=[|v_#memory_$Pointer$.base_38|]} [2019-11-15 23:10:38,324 INFO L375 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-15 23:10:38,324 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-15 23:10:38,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:38,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:10:38,339 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:10:38,514 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-11-15 23:10:38,515 INFO L341 Elim1Store]: treesize reduction 62, result has 75.8 percent of original size [2019-11-15 23:10:38,515 INFO L375 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 65 treesize of output 224 [2019-11-15 23:10:38,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:38,517 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:38,559 INFO L567 ElimStorePlain]: treesize reduction 240, result has 23.6 percent of original size [2019-11-15 23:10:38,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:38,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:10:38,560 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:74 [2019-11-15 23:10:38,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:38,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:38,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:38,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:38,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:38,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:38,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:38,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:38,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:38,986 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:38,986 INFO L375 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 55 treesize of output 50 [2019-11-15 23:10:38,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:38,994 INFO L567 ElimStorePlain]: treesize reduction 14, result has 41.7 percent of original size [2019-11-15 23:10:38,994 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-15 23:10:38,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:4 [2019-11-15 23:10:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:10:39,005 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:10:39,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-11-15 23:10:39,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375843787] [2019-11-15 23:10:39,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 23:10:39,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:10:39,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 23:10:39,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:10:39,006 INFO L87 Difference]: Start difference. First operand 222 states and 283 transitions. Second operand 23 states. [2019-11-15 23:10:39,406 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-11-15 23:10:40,135 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-11-15 23:10:40,325 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-11-15 23:10:40,461 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-11-15 23:10:40,722 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-11-15 23:10:40,891 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 84 [2019-11-15 23:10:41,265 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-11-15 23:10:41,434 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-11-15 23:10:41,653 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-11-15 23:10:42,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:10:42,594 INFO L93 Difference]: Finished difference Result 317 states and 384 transitions. [2019-11-15 23:10:42,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 23:10:42,595 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-15 23:10:42,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:10:42,596 INFO L225 Difference]: With dead ends: 317 [2019-11-15 23:10:42,596 INFO L226 Difference]: Without dead ends: 233 [2019-11-15 23:10:42,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=513, Invalid=2243, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 23:10:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-15 23:10:42,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 198. [2019-11-15 23:10:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-15 23:10:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 244 transitions. [2019-11-15 23:10:42,616 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 244 transitions. Word has length 46 [2019-11-15 23:10:42,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:10:42,617 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 244 transitions. [2019-11-15 23:10:42,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 23:10:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2019-11-15 23:10:42,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 23:10:42,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:10:42,618 INFO L380 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-15 23:10:42,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:10:42,823 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:10:42,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:10:42,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1664417444, now seen corresponding path program 1 times [2019-11-15 23:10:42,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:10:42,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721131809] [2019-11-15 23:10:42,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:42,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:10:42,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:10:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:43,055 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-15 23:10:43,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721131809] [2019-11-15 23:10:43,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262774915] [2019-11-15 23:10:43,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:10:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:10:43,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 23:10:43,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:10:43,196 INFO L375 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-15 23:10:43,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:43,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:43,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:10:43,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 23:10:43,259 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:43,259 INFO L375 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-15 23:10:43,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:43,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:10:43,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:10:43,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 23:10:43,361 INFO L341 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2019-11-15 23:10:43,361 INFO L375 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-15 23:10:43,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:10:43,393 INFO L567 ElimStorePlain]: treesize reduction 22, result has 65.6 percent of original size [2019-11-15 23:10:43,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:43,394 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-15 23:10:43,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:57 [2019-11-15 23:10:43,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:43,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:43,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:43,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:43,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:43,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:10:44,082 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-15 23:10:44,083 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:10:44,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-11-15 23:10:44,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718534409] [2019-11-15 23:10:44,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 23:10:44,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:10:44,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 23:10:44,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:10:44,087 INFO L87 Difference]: Start difference. First operand 198 states and 244 transitions. Second operand 23 states. [2019-11-15 23:11:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:03,475 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2019-11-15 23:11:03,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:11:03,476 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-11-15 23:11:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:03,477 INFO L225 Difference]: With dead ends: 265 [2019-11-15 23:11:03,477 INFO L226 Difference]: Without dead ends: 174 [2019-11-15 23:11:03,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 23:11:03,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-15 23:11:03,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2019-11-15 23:11:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-15 23:11:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 200 transitions. [2019-11-15 23:11:03,498 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 200 transitions. Word has length 50 [2019-11-15 23:11:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:03,498 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 200 transitions. [2019-11-15 23:11:03,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 23:11:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 200 transitions. [2019-11-15 23:11:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:11:03,499 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:03,500 INFO L380 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-15 23:11:03,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:03,704 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash -447177867, now seen corresponding path program 2 times [2019-11-15 23:11:03,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:03,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341786581] [2019-11-15 23:11:03,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:03,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:03,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:03,769 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-15 23:11:03,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341786581] [2019-11-15 23:11:03,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:11:03,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:11:03,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789540401] [2019-11-15 23:11:03,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:11:03,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:03,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:11:03,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:11:03,770 INFO L87 Difference]: Start difference. First operand 164 states and 200 transitions. Second operand 6 states. [2019-11-15 23:11:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:03,812 INFO L93 Difference]: Finished difference Result 174 states and 210 transitions. [2019-11-15 23:11:03,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:11:03,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 23:11:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:03,814 INFO L225 Difference]: With dead ends: 174 [2019-11-15 23:11:03,814 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 23:11:03,814 INFO L600 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-15 23:11:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 23:11:03,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-11-15 23:11:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-15 23:11:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 182 transitions. [2019-11-15 23:11:03,833 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 182 transitions. Word has length 52 [2019-11-15 23:11:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:03,834 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 182 transitions. [2019-11-15 23:11:03,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:11:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 182 transitions. [2019-11-15 23:11:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 23:11:03,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:03,836 INFO L380 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-15 23:11:03,836 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:03,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:03,836 INFO L82 PathProgramCache]: Analyzing trace with hash -200998585, now seen corresponding path program 3 times [2019-11-15 23:11:03,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:03,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762278217] [2019-11-15 23:11:03,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:03,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:03,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:04,376 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-15 23:11:04,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762278217] [2019-11-15 23:11:04,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188498476] [2019-11-15 23:11:04,377 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:11:04,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-15 23:11:04,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:11:04,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-15 23:11:04,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:04,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:04,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:04,596 INFO L375 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-15 23:11:04,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:04,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:04,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:04,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:04,636 INFO L375 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-15 23:11:04,636 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:04,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:04,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:04,658 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:62 [2019-11-15 23:11:04,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:04,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:04,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:04,890 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:04,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:04,900 INFO L375 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-15 23:11:04,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:04,945 INFO L567 ElimStorePlain]: treesize reduction 57, result has 66.5 percent of original size [2019-11-15 23:11:04,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:04,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:04,949 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:04,949 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:04,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:04,951 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:04,975 INFO L341 Elim1Store]: treesize reduction 18, result has 67.3 percent of original size [2019-11-15 23:11:04,975 INFO L375 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 95 treesize of output 101 [2019-11-15 23:11:04,976 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:05,007 INFO L567 ElimStorePlain]: treesize reduction 19, result has 81.2 percent of original size [2019-11-15 23:11:05,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:05,007 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:82 [2019-11-15 23:11:05,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:05,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:05,202 INFO L375 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 90 treesize of output 70 [2019-11-15 23:11:05,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:05,249 INFO L567 ElimStorePlain]: treesize reduction 9, result has 91.2 percent of original size [2019-11-15 23:11:05,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:05,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:05,255 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:05,277 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:05,277 INFO L375 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 66 treesize of output 92 [2019-11-15 23:11:05,278 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:05,310 INFO L567 ElimStorePlain]: treesize reduction 18, result has 77.5 percent of original size [2019-11-15 23:11:05,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:05,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:132, output treesize:62 [2019-11-15 23:11:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 23:11:05,758 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:11:05,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-11-15 23:11:05,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710358634] [2019-11-15 23:11:05,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 23:11:05,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:05,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 23:11:05,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2019-11-15 23:11:05,760 INFO L87 Difference]: Start difference. First operand 156 states and 182 transitions. Second operand 29 states. [2019-11-15 23:11:07,164 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-11-15 23:11:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:08,076 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2019-11-15 23:11:08,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-15 23:11:08,076 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 53 [2019-11-15 23:11:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:08,077 INFO L225 Difference]: With dead ends: 177 [2019-11-15 23:11:08,077 INFO L226 Difference]: Without dead ends: 119 [2019-11-15 23:11:08,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=466, Invalid=2614, Unknown=0, NotChecked=0, Total=3080 [2019-11-15 23:11:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-15 23:11:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2019-11-15 23:11:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-15 23:11:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2019-11-15 23:11:08,087 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 53 [2019-11-15 23:11:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:08,087 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2019-11-15 23:11:08,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 23:11:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2019-11-15 23:11:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 23:11:08,088 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:08,088 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:08,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:08,288 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:08,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:08,289 INFO L82 PathProgramCache]: Analyzing trace with hash -866692449, now seen corresponding path program 2 times [2019-11-15 23:11:08,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:08,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754272984] [2019-11-15 23:11:08,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:08,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:08,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 23:11:08,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754272984] [2019-11-15 23:11:08,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176740707] [2019-11-15 23:11:08,855 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:11:08,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:11:08,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:11:08,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-15 23:11:08,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:09,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:09,158 INFO L375 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-15 23:11:09,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:09,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:09,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:09,194 INFO L375 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-15 23:11:09,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:09,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:09,210 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-15 23:11:09,210 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:77 [2019-11-15 23:11:09,633 INFO L392 ElimStorePlain]: Different costs {20=[|#memory_$Pointer$.offset|], 32=[|#memory_$Pointer$.base|]} [2019-11-15 23:11:09,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:09,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:09,693 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:09,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 170 [2019-11-15 23:11:09,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:09,697 INFO L567 ElimStorePlain]: treesize reduction 151, result has 0.7 percent of original size [2019-11-15 23:11:09,698 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.base| vanished before elimination [2019-11-15 23:11:09,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:09,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:170, output treesize:1 [2019-11-15 23:11:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 49 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-15 23:11:09,712 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:11:09,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-11-15 23:11:09,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057628107] [2019-11-15 23:11:09,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 23:11:09,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:09,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 23:11:09,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2019-11-15 23:11:09,713 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand 31 states. [2019-11-15 23:11:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:11,372 INFO L93 Difference]: Finished difference Result 205 states and 236 transitions. [2019-11-15 23:11:11,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:11:11,373 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2019-11-15 23:11:11,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:11,374 INFO L225 Difference]: With dead ends: 205 [2019-11-15 23:11:11,374 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 23:11:11,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=319, Invalid=2231, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 23:11:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 23:11:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 104. [2019-11-15 23:11:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 23:11:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2019-11-15 23:11:11,386 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 57 [2019-11-15 23:11:11,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:11,387 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2019-11-15 23:11:11,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 23:11:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2019-11-15 23:11:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:11:11,388 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:11,388 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:11,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:11,591 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:11,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1261044102, now seen corresponding path program 3 times [2019-11-15 23:11:11,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:11,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364521066] [2019-11-15 23:11:11,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:11,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:11,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 23:11:12,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364521066] [2019-11-15 23:11:12,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853394190] [2019-11-15 23:11:12,075 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/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-15 23:11:12,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-15 23:11:12,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:11:12,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 110 conjunts are in the unsatisfiable core [2019-11-15 23:11:12,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:12,236 INFO L375 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-15 23:11:12,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:12,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2019-11-15 23:11:12,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:12,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:12,294 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 26 [2019-11-15 23:11:12,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:12,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:52 [2019-11-15 23:11:12,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:12,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:11:12,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:12,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:52 [2019-11-15 23:11:12,551 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_41|], 16=[|v_#memory_$Pointer$.base_45|]} [2019-11-15 23:11:12,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:12,565 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:12,579 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-15 23:11:12,579 INFO L375 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 35 treesize of output 24 [2019-11-15 23:11:12,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:12,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:12,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:12,646 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:12,662 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:12,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2019-11-15 23:11:12,663 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,746 INFO L567 ElimStorePlain]: treesize reduction 12, result has 87.5 percent of original size [2019-11-15 23:11:12,747 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-15 23:11:12,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:111 [2019-11-15 23:11:12,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:14,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:14,478 INFO L392 ElimStorePlain]: Different costs {28=[|v_#memory_$Pointer$.offset_42|], 46=[|v_#memory_$Pointer$.base_46|]} [2019-11-15 23:11:14,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:14,485 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:14,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:14,491 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:14,533 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:14,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 200 [2019-11-15 23:11:14,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:14,548 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:14,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:14,550 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:14,594 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:14,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 172 treesize of output 308 [2019-11-15 23:11:14,596 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,803 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2019-11-15 23:11:14,804 INFO L567 ElimStorePlain]: treesize reduction 254, result has 54.2 percent of original size [2019-11-15 23:11:14,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:14,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:14,824 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:14,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:14,841 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:14,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:15,025 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-15 23:11:15,026 INFO L341 Elim1Store]: treesize reduction 42, result has 78.7 percent of original size [2019-11-15 23:11:15,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 135 treesize of output 237 [2019-11-15 23:11:15,027 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:15,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:15,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:15,036 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:15,041 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:11:15,234 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-15 23:11:15,234 INFO L341 Elim1Store]: treesize reduction 42, result has 83.6 percent of original size [2019-11-15 23:11:15,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 164 treesize of output 315 [2019-11-15 23:11:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:15,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:15,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:15,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,266 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:11:15,473 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2019-11-15 23:11:15,473 INFO L567 ElimStorePlain]: treesize reduction 302, result has 47.7 percent of original size [2019-11-15 23:11:15,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 23:11:15,474 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:341, output treesize:275 [2019-11-15 23:11:15,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,698 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-11-15 23:11:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:15,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,239 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-11-15 23:11:16,549 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2019-11-15 23:11:16,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:11:17,148 WARN L191 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2019-11-15 23:12:04,569 WARN L191 SmtUtils]: Spent 38.11 s on a formula simplification. DAG size of input: 350 DAG size of output: 216 [2019-11-15 23:12:37,940 WARN L191 SmtUtils]: Spent 29.21 s on a formula simplification that was a NOOP. DAG size: 226 [2019-11-15 23:12:37,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 23:13:04,192 WARN L191 SmtUtils]: Spent 25.44 s on a formula simplification that was a NOOP. DAG size: 227 [2019-11-15 23:13:29,087 WARN L191 SmtUtils]: Spent 20.72 s on a formula simplification that was a NOOP. DAG size: 223 [2019-11-15 23:13:47,522 WARN L191 SmtUtils]: Spent 18.28 s on a formula simplification that was a NOOP. DAG size: 220 [2019-11-15 23:13:47,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 23:14:41,559 WARN L191 SmtUtils]: Spent 53.25 s on a formula simplification. DAG size of input: 1274 DAG size of output: 224 [2019-11-15 23:14:41,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-15 23:14:44,668 WARN L191 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 1982 DAG size of output: 302 [2019-11-15 23:14:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 23:14:44,820 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:14:44,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 34 [2019-11-15 23:14:44,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800138057] [2019-11-15 23:14:44,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 23:14:44,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:14:44,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 23:14:44,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1005, Unknown=8, NotChecked=0, Total=1122 [2019-11-15 23:14:44,822 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 34 states. [2019-11-15 23:14:45,763 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-11-15 23:14:45,959 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-11-15 23:14:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:14:47,630 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2019-11-15 23:14:47,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-15 23:14:47,631 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-11-15 23:14:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:14:47,631 INFO L225 Difference]: With dead ends: 132 [2019-11-15 23:14:47,631 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:14:47,633 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 29 SyntacticMatches, 29 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 213.1s TimeCoverageRelationStatistics Valid=345, Invalid=2839, Unknown=8, NotChecked=0, Total=3192 [2019-11-15 23:14:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:14:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:14:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:14:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:14:47,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2019-11-15 23:14:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:14:47,634 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:14:47,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 23:14:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:14:47,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:14:47,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:14:47,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:14:48,086 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 255 [2019-11-15 23:14:49,836 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 252 DAG size of output: 89 [2019-11-15 23:15:06,136 WARN L191 SmtUtils]: Spent 16.29 s on a formula simplification. DAG size of input: 769 DAG size of output: 188 [2019-11-15 23:15:06,334 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 71 [2019-11-15 23:15:06,780 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 89 [2019-11-15 23:15:16,008 WARN L191 SmtUtils]: Spent 9.22 s on a formula simplification. DAG size of input: 752 DAG size of output: 1 [2019-11-15 23:15:16,667 WARN L191 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 102 [2019-11-15 23:15:17,107 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 76 [2019-11-15 23:15:17,108 INFO L446 ceAbstractionStarter]: At program point L609(lines 587 610) the Hoare annotation is: true [2019-11-15 23:15:17,109 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 577) no Hoare annotation was computed. [2019-11-15 23:15:17,109 INFO L439 ceAbstractionStarter]: At program point L572(lines 572 578) the Hoare annotation is: (let ((.cse18 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse19 (= 0 |ULTIMATE.start_main_~#list~0.offset|)) (.cse20 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset)) (.cse21 (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1)) (.cse22 (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base)) (.cse23 (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (let ((.cse2 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) .cse23)) (.cse0 (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (.cse1 (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base))) (.cse4 (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_remove_~x.base)) (.cse5 (and (= 0 ULTIMATE.start_main_~n~0.offset) .cse18 .cse19 .cse20 .cse21 .cse22 (not (= 0 |ULTIMATE.start_main_~#list~0.base|)))) (.cse6 (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_re_insert_~x.base)) (.cse7 (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1)) (.cse8 (= ULTIMATE.start_main_~x~0.offset 0)) (.cse9 (= ULTIMATE.start_main_~x~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) .cse23))) (.cse10 (= 0 ULTIMATE.start_re_insert_~x.offset)) (.cse11 (= |ULTIMATE.start_main_~#list~0.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_remove_~x.base) ULTIMATE.start_remove_~x.offset))) (.cse12 (<= (+ ULTIMATE.start_main_~tail~0.base 1) |#StackHeapBarrier|)) (.cse13 (<= (+ |ULTIMATE.start_main_~#list~0.base| 2) ULTIMATE.start_main_~x~0.base)) (.cse14 (not (= ULTIMATE.start_main_~n~0.base 0))) (.cse15 (<= (+ ULTIMATE.start_main_~tail~0.base 2) ULTIMATE.start_main_~n~0.base)) (.cse16 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|)) (.cse17 (not (= ULTIMATE.start_main_~x~0.base 0)))) (or (let ((.cse3 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base))) (and .cse0 .cse1 (= 0 .cse2) (= 0 (select .cse3 4)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ULTIMATE.start_remove_~x.offset ULTIMATE.start_main_~x~0.offset) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= (select .cse3 0) |ULTIMATE.start_main_~#list~0.offset|) .cse16 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base) 4) 0) .cse17)) (and (= ULTIMATE.start_main_~x~0.offset .cse2) .cse0 .cse1 (= ULTIMATE.start_remove_~x.offset 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= |ULTIMATE.start_main_~#list~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_re_insert_~x.base) ULTIMATE.start_re_insert_~x.offset)) .cse16 (not (= ULTIMATE.start_main_~n~0.base ULTIMATE.start_main_~x~0.base)) .cse17) (and (< |ULTIMATE.start_main_~#list~0.base| |#StackHeapBarrier|) .cse18 .cse19 .cse20 .cse21 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|) .cse22 (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|))))) [2019-11-15 23:15:17,109 INFO L443 ceAbstractionStarter]: For program point L601(lines 601 602) no Hoare annotation was computed. [2019-11-15 23:15:17,109 INFO L439 ceAbstractionStarter]: At program point L601-2(lines 593 603) the Hoare annotation is: (let ((.cse24 (+ |ULTIMATE.start_main_~#list~0.offset| 4)) (.cse20 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base))) (let ((.cse18 (select .cse20 ULTIMATE.start_main_~n~0.offset)) (.cse17 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base)) (.cse21 (+ ULTIMATE.start_main_~n~0.offset 4)) (.cse19 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base)) (.cse22 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base)) (.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) .cse24)) (.cse23 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) .cse24))) (let ((.cse0 (= 0 .cse23)) (.cse4 (= ULTIMATE.start_main_~n~0.offset .cse23)) (.cse3 (= ULTIMATE.start_main_~n~0.base .cse9)) (.cse5 (= (select .cse22 ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.offset|)) (.cse13 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|)) (.cse11 (select .cse19 0)) (.cse16 (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base)) (.cse15 (= ULTIMATE.start_main_~x~0.offset 0)) (.cse12 (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1)) (.cse7 (= 0 (select .cse22 .cse21))) (.cse1 (+ |ULTIMATE.start_main_~#list~0.base| 2)) (.cse10 (select .cse17 0)) (.cse6 (= .cse18 |ULTIMATE.start_main_~#list~0.base|)) (.cse14 (not (= ULTIMATE.start_main_~x~0.base 0))) (.cse8 (= 0 (select .cse20 .cse21)))) (or (and (and .cse0 (and (and (let ((.cse2 (and (not (= ULTIMATE.start_main_~x~0.base .cse9)) (and (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|) (< ULTIMATE.start_main_~tail~0.base |#StackHeapBarrier|))))) (or (and (<= .cse1 ULTIMATE.start_main_~n~0.base) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 (= .cse9 0)))) (= .cse10 0) (not (= ULTIMATE.start_main_~x~0.base .cse11)) (= 0 ULTIMATE.start_main_~tail~0.offset)) .cse12) .cse13 .cse14) .cse15 .cse16) (and (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base)) .cse0 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset) (= 0 (select .cse17 4)) .cse4 (and .cse3 (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1) .cse5 .cse13 (= .cse11 |ULTIMATE.start_main_~#list~0.base|) .cse16) .cse15 .cse12 .cse7 (not (= 0 .cse18)) (<= .cse1 ULTIMATE.start_main_~x~0.base) (not (= ULTIMATE.start_main_~n~0.base 0)) (<= (+ ULTIMATE.start_main_~tail~0.base 2) ULTIMATE.start_main_~n~0.base) (= .cse10 |ULTIMATE.start_main_~#list~0.offset|) (<= (+ |ULTIMATE.start_main_~#list~0.base| 1) |#StackHeapBarrier|) .cse6 .cse14 (= (select .cse19 4) 0) .cse8))))) [2019-11-15 23:15:17,109 INFO L439 ceAbstractionStarter]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse1 (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1)) (.cse2 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset)) (.cse0 (= 0 |ULTIMATE.start_main_~#list~0.offset|))) (or (and (< |ULTIMATE.start_main_~#list~0.base| |#StackHeapBarrier|) .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|) (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base) (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|)) (let ((.cse10 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base)) (.cse8 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base))) (let ((.cse4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0.base|) (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (.cse7 (select .cse8 ULTIMATE.start_main_~n~0.offset)) (.cse6 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base)) (.cse5 (select .cse10 ULTIMATE.start_main_~n~0.offset)) (.cse3 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base)) (.cse9 (+ ULTIMATE.start_main_~n~0.offset 4))) (and (and (= (select .cse3 0) |ULTIMATE.start_main_~#list~0.base|) .cse1) (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base)) (= 0 .cse4) .cse2 (= .cse5 ULTIMATE.start_main_~tail~0.base) (= 0 (select .cse6 4)) (= ULTIMATE.start_main_~n~0.base (select (select |#memory_$Pointer$.base| .cse5) (+ .cse7 4))) (= ULTIMATE.start_main_~n~0.offset .cse4) .cse0 (= ULTIMATE.start_main_~x~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 0 (select .cse8 .cse9)) (not (= 0 .cse5)) (<= (+ |ULTIMATE.start_main_~#list~0.base| 2) ULTIMATE.start_main_~x~0.base) (not (= ULTIMATE.start_main_~n~0.base 0)) (<= (+ ULTIMATE.start_main_~tail~0.base 2) ULTIMATE.start_main_~n~0.base) (= .cse7 |ULTIMATE.start_main_~#list~0.offset|) (= (select .cse6 0) |ULTIMATE.start_main_~#list~0.offset|) (<= (+ |ULTIMATE.start_main_~#list~0.base| 1) |#StackHeapBarrier|) (= .cse5 |ULTIMATE.start_main_~#list~0.base|) (not (= ULTIMATE.start_main_~x~0.base 0)) (= (select .cse3 4) 0) (= 0 (select .cse10 .cse9))))))) [2019-11-15 23:15:17,110 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:15:17,110 INFO L443 ceAbstractionStarter]: For program point L606(line 606) no Hoare annotation was computed. [2019-11-15 23:15:17,110 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:15:17,110 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:15:17,110 INFO L439 ceAbstractionStarter]: At program point L606-2(line 606) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base))) (let ((.cse0 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base)) (.cse1 (select .cse2 ULTIMATE.start_main_~x~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset)) (= ULTIMATE.start_main_~n~0.offset |ULTIMATE.start_main_~#list~0.offset|) (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base) (= 1 (select |#valid| ULTIMATE.start_main_~n~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) (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_remove_~x.base) (= (select .cse0 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| .cse1) (+ (select .cse0 ULTIMATE.start_main_~x~0.offset) 4))) (not (= 0 ULTIMATE.start_main_~tail~0.base)) (= 0 |ULTIMATE.start_main_~#list~0.offset|) (= ULTIMATE.start_main_~x~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (< ULTIMATE.start_main_~tail~0.base |#StackHeapBarrier|) (= (select .cse0 (+ ULTIMATE.start_main_~x~0.offset 4)) 0) (<= (+ |ULTIMATE.start_main_~#list~0.base| 2) ULTIMATE.start_main_~x~0.base) (not |ULTIMATE.start_main_#t~short21|) (not (= ULTIMATE.start_main_~n~0.base 0)) (= .cse1 |ULTIMATE.start_main_~#list~0.base|) (<= (+ ULTIMATE.start_main_~tail~0.base 2) ULTIMATE.start_main_~n~0.base) (= 0 (select (select |#memory_$Pointer$.base| .cse1) (+ |ULTIMATE.start_main_~#list~0.offset| 4))) (= (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|) (not (= ULTIMATE.start_main_~x~0.base 0)) (= (select .cse2 4) 0)))) [2019-11-15 23:15:17,110 INFO L443 ceAbstractionStarter]: For program point L606-3(line 606) no Hoare annotation was computed. [2019-11-15 23:15:17,110 INFO L443 ceAbstractionStarter]: For program point L606-4(line 606) no Hoare annotation was computed. [2019-11-15 23:15:17,111 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 570) no Hoare annotation was computed. [2019-11-15 23:15:17,111 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 571) no Hoare annotation was computed. [2019-11-15 23:15:17,111 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-15 23:15:17,111 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:15:17,111 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 575) no Hoare annotation was computed. [2019-11-15 23:15:17,111 INFO L443 ceAbstractionStarter]: For program point L574-2(lines 574 575) no Hoare annotation was computed. [2019-11-15 23:15:17,111 INFO L443 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-11-15 23:15:17,112 INFO L439 ceAbstractionStarter]: At program point L5-2(lines 4 9) the Hoare annotation is: (let ((.cse26 (select |#memory_$Pointer$.base| ULTIMATE.start_main_~x~0.base))) (let ((.cse9 (select .cse26 0)) (.cse24 (select |#memory_$Pointer$.base| ULTIMATE.start_remove_~x.base)) (.cse6 (+ ULTIMATE.start_remove_~x.offset 4)) (.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse1 (= (select |#valid| |ULTIMATE.start_main_~#list~0.base|) 1)) (.cse3 (= |ULTIMATE.start_main_~#list~0.base| ULTIMATE.start_main_~tail~0.base)) (.cse27 (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~x~0.base))) (let ((.cse8 (= (select .cse27 0) 0)) (.cse10 (<= (+ |ULTIMATE.start_main_~#list~0.base| 2) ULTIMATE.start_main_~x~0.base)) (.cse11 (and .cse0 .cse1 .cse3)) (.cse14 (select .cse24 .cse6)) (.cse2 (= ULTIMATE.start_main_~x~0.offset |ULTIMATE.start_main_~#list~0.offset|)) (.cse7 (+ |ULTIMATE.start_main_~#list~0.offset| 4)) (.cse19 (= ULTIMATE.start_main_~n~0.offset |ULTIMATE.start_main_~#list~0.offset|)) (.cse21 (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset))) (.cse13 (= 0 ULTIMATE.start_main_~tail~0.offset)) (.cse4 (= 1 (select |#valid| ULTIMATE.start_main_~n~0.base))) (.cse18 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_remove_~x.offset)) (.cse5 (= ULTIMATE.start_main_~x~0.base ULTIMATE.start_remove_~x.base)) (.cse22 (= ULTIMATE.start_main_~x~0.offset 0)) (.cse20 (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1)) (.cse12 (not (= 0 .cse9))) (.cse15 (<= (+ ULTIMATE.start_main_~tail~0.base 1) |#StackHeapBarrier|)) (.cse16 (not (= ULTIMATE.start_main_~n~0.base 0))) (.cse17 (<= (+ ULTIMATE.start_main_~tail~0.base 2) ULTIMATE.start_main_~n~0.base)) (.cse23 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~n~0.base) ULTIMATE.start_main_~n~0.offset) |ULTIMATE.start_main_~#list~0.base|))) (or (and (< |ULTIMATE.start_main_~#list~0.base| |#StackHeapBarrier|) .cse0 (= 0 |ULTIMATE.start_main_~#list~0.offset|) .cse1 (= |ULTIMATE.start_main_~#list~0.offset| ULTIMATE.start_main_~tail~0.offset) .cse2 .cse3 (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_~#list~0.base|)) (and .cse4 (and .cse5 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_remove_~x.base) .cse6) 0) (and (not (= ULTIMATE.start_main_~x~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0.base|) .cse7))) .cse8 (= .cse9 |ULTIMATE.start_main_~#list~0.base|) .cse10 .cse11) .cse2 .cse12 .cse13 (= 0 .cse14) .cse15 .cse16 .cse17 .cse18 (not (= ULTIMATE.start_main_~x~0.base 0))) .cse19 .cse20 .cse21 .cse22 .cse23 (not (= ULTIMATE.start_main_~n~0.base ULTIMATE.start_main_~x~0.base))) (and (let ((.cse25 (select .cse26 4))) (and .cse8 (= |ULTIMATE.start_main_~#list~0.base| (select .cse24 ULTIMATE.start_remove_~x.offset)) .cse10 .cse11 (not (= ULTIMATE.start_main_~x~0.base .cse14)) .cse2 (= .cse25 (select (select |#memory_$Pointer$.base| .cse9) .cse7)) (= .cse25 0))) .cse19 .cse21 .cse13 .cse4 .cse18 .cse5 (= 0 (select (select |#memory_$Pointer$.offset| (select .cse26 ULTIMATE.start_main_~x~0.offset)) (+ (select .cse27 ULTIMATE.start_main_~x~0.offset) 4))) .cse22 .cse20 .cse12 .cse15 (= (select .cse27 (+ ULTIMATE.start_main_~x~0.offset 4)) 0) .cse16 .cse17 .cse23))))) [2019-11-15 23:15:17,112 INFO L443 ceAbstractionStarter]: For program point L5-3(lines 5 7) no Hoare annotation was computed. [2019-11-15 23:15:17,112 INFO L443 ceAbstractionStarter]: For program point L608(line 608) no Hoare annotation was computed. [2019-11-15 23:15:17,112 INFO L446 ceAbstractionStarter]: At program point L5-5(lines 4 9) the Hoare annotation is: true [2019-11-15 23:15:17,112 INFO L443 ceAbstractionStarter]: For program point L604(line 604) no Hoare annotation was computed. [2019-11-15 23:15:17,112 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-15 23:15:17,112 INFO L443 ceAbstractionStarter]: For program point L567(lines 567 568) no Hoare annotation was computed. [2019-11-15 23:15:17,112 INFO L443 ceAbstractionStarter]: For program point L567-2(lines 567 568) no Hoare annotation was computed. [2019-11-15 23:15:17,112 INFO L443 ceAbstractionStarter]: For program point L596(lines 596 597) no Hoare annotation was computed. [2019-11-15 23:15:17,112 INFO L443 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-11-15 23:15:17,112 INFO L443 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-11-15 23:15:17,113 INFO L446 ceAbstractionStarter]: At program point is_list_containing_xENTRY(lines 579 586) the Hoare annotation is: true [2019-11-15 23:15:17,113 INFO L439 ceAbstractionStarter]: At program point L584(line 584) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.base| |is_list_containing_x_#in~l.base|)) (.cse27 (+ |is_list_containing_x_#in~l.offset| 4))) (let ((.cse26 (select .cse9 .cse27)) (.cse25 (select (select |#memory_$Pointer$.offset| |is_list_containing_x_#in~l.base|) .cse27))) (let ((.cse0 (= |is_list_containing_x_#in~x.offset| |is_list_containing_x_#in~l.offset|)) (.cse2 (= |is_list_containing_x_#t~mem14.offset| .cse25)) (.cse3 (= .cse26 |is_list_containing_x_#t~mem14.base|)) (.cse1 (or (not (= 0 .cse25)) (not (= .cse26 0))))) (and (or (not .cse0) (not (= |is_list_containing_x_#in~l.base| |is_list_containing_x_#in~x.base|))) (or (and (and (= 0 |is_list_containing_x_#in~x.base|) (= |is_list_containing_x_#in~x.offset| 0)) .cse0) (and .cse1 .cse2 .cse3)) (or (forall ((v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12 Int)) (let ((.cse8 (select |#memory_$Pointer$.offset| v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12))) (let ((.cse7 (select .cse8 0)) (.cse4 (select |#memory_$Pointer$.base| v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12))) (let ((.cse5 (select .cse4 0)) (.cse6 (+ .cse7 4))) (or (not (= (select .cse4 4) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (not (= 0 .cse7)) (not (= 0 (select .cse8 4))) (= 0 v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12) (not (<= (+ .cse5 2) v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12)) (not (= v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_12 (select (select |#memory_$Pointer$.base| .cse5) .cse6)))))))) (and (or (not (= |is_list_containing_x_#t~mem14.offset| 0)) (not (= 0 |is_list_containing_x_#t~mem14.base|))) .cse2 (or (= (select .cse9 4) |is_list_containing_x_#t~mem14.base|) (not (= |is_list_containing_x_#in~l.offset| 0)))) (forall ((ULTIMATE.start_main_~tail~0.offset Int) (v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_14 Int)) (let ((.cse10 (select |#memory_$Pointer$.base| v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_14))) (let ((.cse11 (select .cse10 0))) (or (not (= (select .cse10 4) 0)) (not (= v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_14 (select (select |#memory_$Pointer$.base| .cse11) (+ ULTIMATE.start_main_~tail~0.offset 4)))) (not (<= (+ .cse11 2) v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_14)) (= .cse11 0)))))) (or (and .cse2 .cse3 .cse1) (forall ((v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_6 Int)) (let ((.cse14 (select |#memory_$Pointer$.base| v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_6))) (let ((.cse13 (select .cse14 4)) (.cse12 (select .cse14 0))) (or (not (= (select (select |#memory_$Pointer$.base| .cse12) 4) .cse13)) (not (= 0 .cse13)) (= v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_6 0) (not (<= (+ .cse12 2) v_ULTIMATE.start_main_~x~0.base_BEFORE_CALL_6)))))) (and (or (forall ((v_prenex_22 Int)) (let ((.cse19 (select |#memory_$Pointer$.base| v_prenex_22))) (let ((.cse16 (select .cse19 0))) (let ((.cse15 (select (select |#memory_$Pointer$.offset| .cse16) 4)) (.cse18 (select (select |#memory_$Pointer$.base| .cse16) 4)) (.cse17 (select |#memory_$Pointer$.offset| v_prenex_22))) (or (not (= .cse15 0)) (not (<= (+ .cse16 2) v_prenex_22)) (not (= .cse15 (select .cse17 4))) (not (= .cse18 (select .cse19 4))) (not (= .cse18 0)) (not (= 0 (select .cse17 0)))))))) (forall ((v_prenex_21 Int) (v_prenex_20 Int)) (= (select (select |#memory_$Pointer$.base| v_prenex_20) (+ v_prenex_21 4)) 0))) (or (forall ((v_arrayElimCell_66 Int)) (let ((.cse24 (select |#memory_$Pointer$.base| v_arrayElimCell_66))) (let ((.cse21 (select .cse24 0))) (let ((.cse23 (select |#memory_$Pointer$.offset| v_arrayElimCell_66)) (.cse22 (select (select |#memory_$Pointer$.offset| .cse21) 4)) (.cse20 (select (select |#memory_$Pointer$.base| .cse21) 4))) (or (not (= .cse20 0)) (not (<= (+ .cse21 2) v_arrayElimCell_66)) (not (= 0 .cse22)) (not (= 0 (select .cse23 0))) (not (= (select .cse23 4) .cse22)) (not (= .cse20 (select .cse24 4)))))))) (forall ((|v_is_list_containing_x_#in~l.base_BEFORE_CALL_4| Int) (|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_4| Int)) (= (select (select |#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_4|) (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_4| 4)) 0))))) (= |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|) (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~l.offset))))) [2019-11-15 23:15:17,113 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 584) no Hoare annotation was computed. [2019-11-15 23:15:17,113 INFO L443 ceAbstractionStarter]: For program point L584-1(line 584) no Hoare annotation was computed. [2019-11-15 23:15:17,113 INFO L443 ceAbstractionStarter]: For program point is_list_containing_xFINAL(lines 579 586) no Hoare annotation was computed. [2019-11-15 23:15:17,113 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 582) no Hoare annotation was computed. [2019-11-15 23:15:17,113 INFO L443 ceAbstractionStarter]: For program point is_list_containing_xEXIT(lines 579 586) no Hoare annotation was computed. [2019-11-15 23:15:17,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,143 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,146 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,147 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,148 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,148 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,148 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,148 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,148 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,149 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,149 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,149 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,149 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,150 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,152 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,157 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,157 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,163 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,163 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,163 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,164 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,165 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,169 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,178 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,178 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,178 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,178 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,178 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,179 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,179 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,179 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,180 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,183 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,183 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,183 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,185 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,185 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,185 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,188 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,188 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,191 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,191 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,191 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,196 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,197 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,201 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,202 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:15:17 BoogieIcfgContainer [2019-11-15 23:15:17,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:15:17,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:15:17,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:15:17,205 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:15:17,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:09:00" (3/4) ... [2019-11-15 23:15:17,209 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:15:17,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_list_containing_x [2019-11-15 23:15:17,220 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-15 23:15:17,220 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 23:15:17,220 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:15:17,270 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_11e36c8e-11fc-4d91-a19f-900d6adf99a0/bin/uautomizer/witness.graphml [2019-11-15 23:15:17,270 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:15:17,271 INFO L168 Benchmark]: Toolchain (without parser) took 377463.57 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 434.1 MB). Free memory was 943.4 MB in the beginning and 794.7 MB in the end (delta: 148.7 MB). Peak memory consumption was 582.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:15:17,272 INFO L168 Benchmark]: CDTParser took 5.75 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-15 23:15:17,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:15:17,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:15:17,273 INFO L168 Benchmark]: Boogie Preprocessor took 30.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:15:17,273 INFO L168 Benchmark]: RCFGBuilder took 442.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:15:17,273 INFO L168 Benchmark]: TraceAbstraction took 376371.28 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.2 MB). Free memory was 1.1 GB in the beginning and 809.5 MB in the end (delta: 264.0 MB). Peak memory consumption was 588.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:15:17,274 INFO L168 Benchmark]: Witness Printer took 65.30 ms. Allocated memory is still 1.5 GB. Free memory was 809.5 MB in the beginning and 794.7 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:15:17,276 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 5.75 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 505.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 442.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 376371.28 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.2 MB). Free memory was 1.1 GB in the beginning and 809.5 MB in the end (delta: 264.0 MB). Peak memory consumption was 588.7 MB. Max. memory is 11.5 GB. * Witness Printer took 65.30 ms. Allocated memory is still 1.5 GB. Free memory was 809.5 MB in the beginning and 794.7 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 * 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 #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 #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 #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 #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 #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 #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 #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 #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 #StackHeapBarrier - 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 #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 #StackHeapBarrier - 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-15 23:15:17,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,302 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,302 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,302 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,303 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,303 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,303 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,303 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,304 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,304 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,304 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,304 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,307 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,307 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,308 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,308 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,308 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,308 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,311 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,311 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,311 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,311 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,312 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,312 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,312 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,312 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,314 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,314 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,314 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,315 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,315 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,315 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,316 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,316 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,316 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,316 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,317 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,317 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,317 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,317 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,318 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,338 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,340 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,343 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,343 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,343 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,343 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((0 == #memory_$Pointer$[list][list + 4] && (((((((((((list + 2 <= n && !(x == #memory_$Pointer$[list][list + 4]) && x == list && tail < unknown-#StackHeapBarrier-unknown) && n == #memory_$Pointer$[list][list + 4]) && n == #memory_$Pointer$[list][list + 4]) && #memory_$Pointer$[n][n] == list) && #memory_$Pointer$[n][n] == list) && 0 == #memory_$Pointer$[n][n + 4]) && 0 == #memory_$Pointer$[n][n + 4]) || ((!(x == #memory_$Pointer$[list][list + 4]) && x == list && tail < unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[list][list + 4] == 0)) && #memory_$Pointer$[x][0] == 0) && !(x == #memory_$Pointer$[x][0])) && 0 == tail) && \valid[x] == 1) && x == list) && !(x == 0)) && x == 0) && list == tail) || ((((((((((((((((((1 == \valid[n] && 0 == #memory_$Pointer$[list][list + 4]) && list == tail) && 0 == #memory_$Pointer$[x][4]) && n == #memory_$Pointer$[list][list + 4]) && ((((n == #memory_$Pointer$[list][list + 4] && \valid[list] == 1) && #memory_$Pointer$[n][n] == list) && x == list) && #memory_$Pointer$[x][0] == list) && list == tail) && x == 0) && \valid[x] == 1) && 0 == #memory_$Pointer$[n][n + 4]) && !(0 == #memory_$Pointer$[n][n])) && list + 2 <= x) && !(n == 0)) && tail + 2 <= n) && #memory_$Pointer$[x][0] == list) && list + 1 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[n][n] == list) && !(x == 0)) && #memory_$Pointer$[x][4] == 0) && 0 == #memory_$Pointer$[n][n + 4]) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant [2019-11-15 23:15:17,345 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,346 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,346 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,346 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,347 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,347 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,347 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,347 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,348 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,348 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,348 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,349 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,349 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,349 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,349 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,350 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,350 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,350 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,350 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,351 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,351 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,351 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,352 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,352 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,352 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,353 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,353 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,353 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,353 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,354 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,354 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,354 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,354 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,355 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,355 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,355 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,356 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,356 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,356 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,356 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,357 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,357 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,357 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,357 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,357 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,358 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,359 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,359 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,359 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,360 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,360 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,360 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,361 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,362 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,362 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,362 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,363 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,363 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,363 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-15 23:15:17,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-15 23:15:17,366 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,366 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,366 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,369 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,369 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,370 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,370 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,370 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,370 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-11-15 23:15:17,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-15 23:15:17,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((list < unknown-#StackHeapBarrier-unknown && !(0 == cond)) && 0 == list) && \valid[list] == 1) && list == tail) && x == list) && list == tail) && x == list) || (((((((1 == \valid[n] && ((((((((((x == x && #memory_$Pointer$[x][x + 4] == 0) && (((!(x == #memory_$Pointer$[list][list + 4]) && #memory_$Pointer$[x][0] == 0) && #memory_$Pointer$[x][0] == list) && list + 2 <= x) && (!(0 == cond) && \valid[list] == 1) && list == tail) && x == list) && !(0 == #memory_$Pointer$[x][0])) && 0 == tail) && 0 == #memory_$Pointer$[x][x + 4]) && tail + 1 <= unknown-#StackHeapBarrier-unknown) && !(n == 0)) && tail + 2 <= n) && list == x) && !(x == 0)) && n == list) && \valid[x] == 1) && 0 == #memory_$Pointer$[n][n]) && x == 0) && #memory_$Pointer$[n][n] == list) && !(n == x))) || ((((((((((((((((((((((#memory_$Pointer$[x][0] == 0 && list == #memory_$Pointer$[x][x]) && list + 2 <= x) && (!(0 == cond) && \valid[list] == 1) && list == tail) && !(x == #memory_$Pointer$[x][x + 4])) && x == list) && #memory_$Pointer$[x][4] == #memory_$Pointer$[#memory_$Pointer$[x][0]][list + 4]) && #memory_$Pointer$[x][4] == 0) && n == list) && 0 == #memory_$Pointer$[n][n]) && 0 == tail) && 1 == \valid[n]) && list == x) && x == x) && 0 == #memory_$Pointer$[#memory_$Pointer$[x][x]][#memory_$Pointer$[x][x] + 4]) && x == 0) && \valid[x] == 1) && !(0 == #memory_$Pointer$[x][0])) && tail + 1 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[x][x + 4] == 0) && !(n == 0)) && tail + 2 <= n) && #memory_$Pointer$[n][n] == list) - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 2 error locations. Result: SAFE, OverallTime: 376.2s, OverallIterations: 23, TraceHistogramMax: 7, AutomataDifference: 106.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 29.2s, HoareTripleCheckerStatistics: 959 SDtfs, 3372 SDslu, 5904 SDs, 0 SdLazy, 7744 SolverSat, 1607 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 61.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1356 GetRequests, 625 SyntacticMatches, 64 SemanticMatches, 667 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8467 ImplicationChecksByTransitivity, 270.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred 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, 521 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 233 PreInvPairs, 263 NumberOfFragments, 1713 HoareAnnotationTreeSize, 233 FomulaSimplifications, 1959043 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 9 FomulaSimplificationsInter, 262497 FormulaSimplificationTreeSizeReductionInter, 28.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 235.0s InterpolantComputationTime, 1543 NumberOfCodeBlocks, 1527 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1506 ConstructedInterpolants, 278 QuantifiedInterpolants, 3094993 SizeOfPredicates, 299 NumberOfNonLiveVariables, 3143 ConjunctsInSsa, 732 ConjunctsInUnsatCore, 37 InterpolantComputations, 9 PerfectInterpolantSequences, 735/1252 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...