java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/list-properties/splice_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:00:58,260 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:00:58,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:00:58,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:00:58,308 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:00:58,309 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:00:58,310 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:00:58,312 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:00:58,315 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:00:58,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:00:58,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:00:58,317 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:00:58,318 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:00:58,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:00:58,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:00:58,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:00:58,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:00:58,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:00:58,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:00:58,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:00:58,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:00:58,332 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:00:58,333 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:00:58,334 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:00:58,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:00:58,336 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:00:58,336 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:00:58,337 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:00:58,337 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:00:58,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:00:58,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:00:58,338 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 01:00:58,346 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:00:58,347 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:00:58,348 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:00:58,348 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:00:58,348 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:00:58,348 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:00:58,348 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:00:58,348 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:00:58,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:00:58,349 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:00:58,349 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:00:58,349 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:00:58,349 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:00:58,349 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:00:58,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:00:58,349 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:00:58,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:00:58,350 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:00:58,350 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:00:58,350 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:00:58,350 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:00:58,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:00:58,350 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:00:58,351 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:00:58,351 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:00:58,351 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:00:58,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:00:58,351 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:00:58,351 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:00:58,352 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:00:58,352 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:00:58,352 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:00:58,352 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:00:58,352 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:00:58,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:00:58,352 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:00:58,352 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:00:58,353 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:00:58,353 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:00:58,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:00:58,396 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:00:58,399 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:00:58,400 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:00:58,401 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:00:58,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice_true-unreach-call_false-valid-memtrack.i [2018-01-21 01:00:58,549 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:00:58,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:00:58,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:00:58,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:00:58,559 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:00:58,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:00:58" (1/1) ... [2018-01-21 01:00:58,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793dbc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:58, skipping insertion in model container [2018-01-21 01:00:58,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:00:58" (1/1) ... [2018-01-21 01:00:58,576 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:00:58,614 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:00:58,743 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:00:58,765 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:00:58,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:58 WrapperNode [2018-01-21 01:00:58,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:00:58,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:00:58,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:00:58,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:00:58,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:58" (1/1) ... [2018-01-21 01:00:58,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:58" (1/1) ... [2018-01-21 01:00:58,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:58" (1/1) ... [2018-01-21 01:00:58,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:58" (1/1) ... [2018-01-21 01:00:58,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:58" (1/1) ... [2018-01-21 01:00:58,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:58" (1/1) ... [2018-01-21 01:00:58,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:58" (1/1) ... [2018-01-21 01:00:58,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:00:58,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:00:58,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:00:58,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:00:58,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:58" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:00:58,883 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:00:58,883 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:00:58,883 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-21 01:00:58,884 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:00:58,884 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:00:58,884 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:00:58,884 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 01:00:58,884 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 01:00:58,884 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:00:58,885 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:00:58,885 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:00:58,885 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:00:58,885 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:00:58,885 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:00:58,885 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-21 01:00:58,886 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:00:58,886 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:00:58,886 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:00:59,200 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:00:59,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:00:59 BoogieIcfgContainer [2018-01-21 01:00:59,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:00:59,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:00:59,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:00:59,204 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:00:59,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:00:58" (1/3) ... [2018-01-21 01:00:59,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afef4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:00:59, skipping insertion in model container [2018-01-21 01:00:59,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:58" (2/3) ... [2018-01-21 01:00:59,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afef4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:00:59, skipping insertion in model container [2018-01-21 01:00:59,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:00:59" (3/3) ... [2018-01-21 01:00:59,207 INFO L105 eAbstractionObserver]: Analyzing ICFG splice_true-unreach-call_false-valid-memtrack.i [2018-01-21 01:00:59,215 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:00:59,222 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 01:00:59,269 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:00:59,269 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:00:59,269 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:00:59,269 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:00:59,270 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:00:59,270 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:00:59,270 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:00:59,270 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-21 01:00:59,271 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:00:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 01:00:59,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 01:00:59,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 64 states. [2018-01-21 01:00:59,388 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-21 01:00:59,389 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-21 01:00:59,389 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-21 01:00:59,389 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-21 01:00:59,389 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-21 01:00:59,390 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 680) no Hoare annotation was computed. [2018-01-21 01:00:59,390 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 680) no Hoare annotation was computed. [2018-01-21 01:00:59,390 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 680) the Hoare annotation is: true [2018-01-21 01:00:59,390 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 680) no Hoare annotation was computed. [2018-01-21 01:00:59,390 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 680) the Hoare annotation is: true [2018-01-21 01:00:59,390 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 680) no Hoare annotation was computed. [2018-01-21 01:00:59,391 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 680) the Hoare annotation is: true [2018-01-21 01:00:59,391 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 680) no Hoare annotation was computed. [2018-01-21 01:00:59,391 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 680) no Hoare annotation was computed. [2018-01-21 01:00:59,391 INFO L401 ceAbstractionStarter]: For program point L659'(line 659) no Hoare annotation was computed. [2018-01-21 01:00:59,391 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-21 01:00:59,391 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-21 01:00:59,391 INFO L401 ceAbstractionStarter]: For program point L675'(line 675) no Hoare annotation was computed. [2018-01-21 01:00:59,392 INFO L404 ceAbstractionStarter]: At program point L674''(lines 674 677) the Hoare annotation is: true [2018-01-21 01:00:59,392 INFO L401 ceAbstractionStarter]: For program point L663'(line 663) no Hoare annotation was computed. [2018-01-21 01:00:59,392 INFO L401 ceAbstractionStarter]: For program point L629'''(line 629) no Hoare annotation was computed. [2018-01-21 01:00:59,392 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 680) no Hoare annotation was computed. [2018-01-21 01:00:59,392 INFO L401 ceAbstractionStarter]: For program point L636'(lines 636 648) no Hoare annotation was computed. [2018-01-21 01:00:59,392 INFO L401 ceAbstractionStarter]: For program point L676'(line 676) no Hoare annotation was computed. [2018-01-21 01:00:59,393 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-21 01:00:59,393 INFO L401 ceAbstractionStarter]: For program point L645(line 645) no Hoare annotation was computed. [2018-01-21 01:00:59,393 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-21 01:00:59,393 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-21 01:00:59,393 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-21 01:00:59,393 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-21 01:00:59,394 INFO L401 ceAbstractionStarter]: For program point L657'(line 657) no Hoare annotation was computed. [2018-01-21 01:00:59,394 INFO L404 ceAbstractionStarter]: At program point L645'(line 645) the Hoare annotation is: true [2018-01-21 01:00:59,394 INFO L404 ceAbstractionStarter]: At program point L629'(line 629) the Hoare annotation is: true [2018-01-21 01:00:59,394 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 680) no Hoare annotation was computed. [2018-01-21 01:00:59,394 INFO L404 ceAbstractionStarter]: At program point L675''(line 675) the Hoare annotation is: true [2018-01-21 01:00:59,395 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-21 01:00:59,395 INFO L401 ceAbstractionStarter]: For program point L637(lines 637 643) no Hoare annotation was computed. [2018-01-21 01:00:59,395 INFO L401 ceAbstractionStarter]: For program point L636(lines 636 648) no Hoare annotation was computed. [2018-01-21 01:00:59,395 INFO L401 ceAbstractionStarter]: For program point L637''(lines 637 643) no Hoare annotation was computed. [2018-01-21 01:00:59,395 INFO L401 ceAbstractionStarter]: For program point L663(line 663) no Hoare annotation was computed. [2018-01-21 01:00:59,395 INFO L401 ceAbstractionStarter]: For program point L645'''(line 645) no Hoare annotation was computed. [2018-01-21 01:00:59,396 INFO L401 ceAbstractionStarter]: For program point L670'(line 670) no Hoare annotation was computed. [2018-01-21 01:00:59,396 INFO L401 ceAbstractionStarter]: For program point L669(lines 669 672) no Hoare annotation was computed. [2018-01-21 01:00:59,396 INFO L404 ceAbstractionStarter]: At program point L669''(lines 669 672) the Hoare annotation is: true [2018-01-21 01:00:59,396 INFO L401 ceAbstractionStarter]: For program point L655'(line 655) no Hoare annotation was computed. [2018-01-21 01:00:59,396 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-21 01:00:59,397 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 626 680) no Hoare annotation was computed. [2018-01-21 01:00:59,397 INFO L401 ceAbstractionStarter]: For program point L655(lines 655 667) no Hoare annotation was computed. [2018-01-21 01:00:59,397 INFO L401 ceAbstractionStarter]: For program point L671'(line 671) no Hoare annotation was computed. [2018-01-21 01:00:59,397 INFO L401 ceAbstractionStarter]: For program point L659(line 659) no Hoare annotation was computed. [2018-01-21 01:00:59,397 INFO L401 ceAbstractionStarter]: For program point L658(lines 658 666) no Hoare annotation was computed. [2018-01-21 01:00:59,397 INFO L401 ceAbstractionStarter]: For program point L657(line 657) no Hoare annotation was computed. [2018-01-21 01:00:59,398 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 680) the Hoare annotation is: true [2018-01-21 01:00:59,398 INFO L404 ceAbstractionStarter]: At program point L636'''(lines 636 648) the Hoare annotation is: true [2018-01-21 01:00:59,398 INFO L401 ceAbstractionStarter]: For program point L674'''(lines 674 677) no Hoare annotation was computed. [2018-01-21 01:00:59,398 INFO L401 ceAbstractionStarter]: For program point L628'(line 628) no Hoare annotation was computed. [2018-01-21 01:00:59,398 INFO L401 ceAbstractionStarter]: For program point L670(line 670) no Hoare annotation was computed. [2018-01-21 01:00:59,399 INFO L401 ceAbstractionStarter]: For program point L674(lines 674 677) no Hoare annotation was computed. [2018-01-21 01:00:59,399 INFO L401 ceAbstractionStarter]: For program point L671(line 671) no Hoare annotation was computed. [2018-01-21 01:00:59,399 INFO L401 ceAbstractionStarter]: For program point L641'(line 641) no Hoare annotation was computed. [2018-01-21 01:00:59,399 INFO L401 ceAbstractionStarter]: For program point L669'''(lines 669 672) no Hoare annotation was computed. [2018-01-21 01:00:59,399 INFO L401 ceAbstractionStarter]: For program point L676(line 676) no Hoare annotation was computed. [2018-01-21 01:00:59,399 INFO L401 ceAbstractionStarter]: For program point L675(line 675) no Hoare annotation was computed. [2018-01-21 01:00:59,400 INFO L404 ceAbstractionStarter]: At program point L658''(lines 658 666) the Hoare annotation is: true [2018-01-21 01:00:59,400 INFO L401 ceAbstractionStarter]: For program point L638'(line 638) no Hoare annotation was computed. [2018-01-21 01:00:59,400 INFO L401 ceAbstractionStarter]: For program point L636''''(lines 636 648) no Hoare annotation was computed. [2018-01-21 01:00:59,400 INFO L401 ceAbstractionStarter]: For program point L655'''(lines 655 667) no Hoare annotation was computed. [2018-01-21 01:00:59,405 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:00:59,405 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:00:59,405 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:00:59,405 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:00:59,405 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:00:59,406 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:00:59,406 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:00:59,406 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:00:59,406 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:00:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 01:00:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:00:59,410 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:59,411 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:00:59,411 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:00:59,417 INFO L82 PathProgramCache]: Analyzing trace with hash 171440, now seen corresponding path program 1 times [2018-01-21 01:00:59,420 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:59,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:59,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:59,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:59,444 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:00:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:00:59,507 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:00:59,513 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:00:59,519 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:00:59,519 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:00:59,519 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:00:59,520 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:00:59,520 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:00:59,520 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:00:59,520 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:00:59,520 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:00:59,520 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:00:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 01:00:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 01:00:59,524 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:59,524 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:00:59,524 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:59,525 INFO L82 PathProgramCache]: Analyzing trace with hash -999156771, now seen corresponding path program 1 times [2018-01-21 01:00:59,525 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:59,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:59,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:59,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:59,527 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:59,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:00:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:00:59,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:00:59,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:00:59,665 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:00:59,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:00:59,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:00:59,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:00:59,682 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-01-21 01:00:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:00:59,701 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2018-01-21 01:00:59,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:00:59,702 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-21 01:00:59,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:00:59,708 INFO L225 Difference]: With dead ends: 99 [2018-01-21 01:00:59,708 INFO L226 Difference]: Without dead ends: 56 [2018-01-21 01:00:59,710 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:00:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-21 01:00:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-21 01:00:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-21 01:00:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-01-21 01:00:59,736 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 17 [2018-01-21 01:00:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:00:59,737 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-01-21 01:00:59,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:00:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-01-21 01:00:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 01:00:59,737 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:59,738 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:00:59,738 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:59,738 INFO L82 PathProgramCache]: Analyzing trace with hash -564250623, now seen corresponding path program 1 times [2018-01-21 01:00:59,738 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:59,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:59,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:59,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:59,739 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:59,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:00:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:00:59,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:00:59,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 01:00:59,815 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:00:59,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 01:00:59,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 01:00:59,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 01:00:59,817 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 4 states. [2018-01-21 01:00:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:00:59,878 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2018-01-21 01:00:59,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 01:00:59,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-21 01:00:59,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:00:59,881 INFO L225 Difference]: With dead ends: 97 [2018-01-21 01:00:59,881 INFO L226 Difference]: Without dead ends: 65 [2018-01-21 01:00:59,882 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 01:00:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-21 01:00:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-01-21 01:00:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-21 01:00:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-01-21 01:00:59,890 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 19 [2018-01-21 01:00:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:00:59,890 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-01-21 01:00:59,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 01:00:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-01-21 01:00:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 01:00:59,891 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:59,892 INFO L322 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, 1, 1] [2018-01-21 01:00:59,892 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:59,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2078626135, now seen corresponding path program 1 times [2018-01-21 01:00:59,892 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:59,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:59,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:59,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:59,893 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:59,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:01:00,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:01:00,068 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:01:00,069 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-01-21 01:01:00,071 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [21], [24], [25], [26], [32], [33], [39], [41], [42], [43], [47], [48], [51], [125], [132], [133], [138], [143], [144], [145], [146] [2018-01-21 01:01:00,117 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:01:00,117 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:01:00,366 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:01:00,367 INFO L268 AbstractInterpreter]: Visited 29 different actions 38 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-01-21 01:01:00,381 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:01:00,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:01:00,381 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 01:01:00,403 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:00,403 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:01:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:00,440 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:01:00,550 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= (store |c_old(#valid)| |main_#t~malloc0.base| 1) |c_#valid|))) is different from true [2018-01-21 01:01:00,566 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int) (|main_#t~malloc4.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc4.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= (select .cse0 |main_#t~malloc4.base|) 0)))) is different from true [2018-01-21 01:01:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 01:01:00,604 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:01:00,712 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 22 DAG size of output 20 [2018-01-21 01:01:00,777 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_6| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc4.base_6|))) (not (= (store |c_#valid| |v_main_#t~malloc4.base_6| 1) |c_old(#valid)|)))) is different from false [2018-01-21 01:01:00,791 WARN L1007 $PredicateComparison]: unable to prove that (or (= c_main_~flag~6 0) (forall ((|v_main_#t~malloc4.base_6| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc4.base_6|))) (not (= (store |c_#valid| |v_main_#t~malloc4.base_6| 1) |c_old(#valid)|))))) is different from false [2018-01-21 01:01:00,809 WARN L1007 $PredicateComparison]: unable to prove that (or (= c_main_~flag~6 0) (forall ((|v_main_#t~malloc4.base_6| Int) (|v_main_#t~malloc0.base_6| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_6| 1))) (or (not (= (store .cse0 |v_main_#t~malloc4.base_6| 1) |c_old(#valid)|)) (not (= (select .cse0 |v_main_#t~malloc4.base_6|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_6|))))))) is different from false [2018-01-21 01:01:00,814 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_6| Int) (|v_main_#t~malloc0.base_6| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_6| 1))) (or (not (= (store .cse0 |v_main_#t~malloc4.base_6| 1) |c_old(#valid)|)) (not (= (select .cse0 |v_main_#t~malloc4.base_6|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_6|)))))) is different from false [2018-01-21 01:01:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 01:01:00,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:01:00,863 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:01:00,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:00,868 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:01:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:00,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:01:01,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:01:01,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 01:01:01,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:01,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:01,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:01,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-21 01:01:01,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-01-21 01:01:01,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-01-21 01:01:01,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:01,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:01,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:01,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:18 [2018-01-21 01:01:01,162 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~6.base 1))) (and (= |c_#valid| (store .cse0 |c_main_#t~mem6.base| 1)) (= (select .cse0 |c_main_#t~mem6.base|) 0)))) is different from true [2018-01-21 01:01:01,167 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (and (= |c_#valid| (store .cse0 main_~p~6.base 1)) (= 0 (select .cse0 main_~p~6.base))))) is different from true [2018-01-21 01:01:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 01:01:01,184 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:01:01,242 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_10| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc4.base_10|))) (not (= (store |c_#valid| |v_main_#t~malloc4.base_10| 1) |c_old(#valid)|)))) is different from false [2018-01-21 01:01:01,257 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_10| Int) (|v_main_#t~malloc4.base_10| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_10| 1))) (or (not (= (store .cse0 |v_main_#t~malloc4.base_10| 1) |c_old(#valid)|)) (not (= 0 (select .cse0 |v_main_#t~malloc4.base_10|)))))) is different from false [2018-01-21 01:01:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 01:01:01,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:01:01,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7, 12, 5] total 26 [2018-01-21 01:01:01,298 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:01:01,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-21 01:01:01,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-21 01:01:01,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=211, Unknown=10, NotChecked=370, Total=650 [2018-01-21 01:01:01,300 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 10 states. [2018-01-21 01:01:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:01,466 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2018-01-21 01:01:01,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 01:01:01,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-21 01:01:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:01,467 INFO L225 Difference]: With dead ends: 153 [2018-01-21 01:01:01,468 INFO L226 Difference]: Without dead ends: 77 [2018-01-21 01:01:01,469 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=296, Unknown=10, NotChecked=430, Total=812 [2018-01-21 01:01:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-21 01:01:01,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2018-01-21 01:01:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-21 01:01:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-21 01:01:01,475 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 31 [2018-01-21 01:01:01,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:01,475 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-21 01:01:01,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-21 01:01:01,475 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-21 01:01:01,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-21 01:01:01,476 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:01,476 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:01:01,476 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:01:01,476 INFO L82 PathProgramCache]: Analyzing trace with hash -225240659, now seen corresponding path program 2 times [2018-01-21 01:01:01,477 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:01,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:01,477 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:01,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:01,478 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:01,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:01:01,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:01:01,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 01:01:01,531 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:01:01,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 01:01:01,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 01:01:01,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 01:01:01,532 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 3 states. [2018-01-21 01:01:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:01,568 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2018-01-21 01:01:01,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 01:01:01,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-01-21 01:01:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:01,571 INFO L225 Difference]: With dead ends: 153 [2018-01-21 01:01:01,571 INFO L226 Difference]: Without dead ends: 107 [2018-01-21 01:01:01,572 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 01:01:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-21 01:01:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2018-01-21 01:01:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-21 01:01:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-01-21 01:01:01,578 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 43 [2018-01-21 01:01:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:01,578 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-01-21 01:01:01,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 01:01:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-01-21 01:01:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-21 01:01:01,579 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:01,580 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:01:01,580 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:01:01,580 INFO L82 PathProgramCache]: Analyzing trace with hash -842427991, now seen corresponding path program 1 times [2018-01-21 01:01:01,580 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:01,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:01,581 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 01:01:01,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:01,581 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:01,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:01:01,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:01:01,759 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:01:01,759 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-01-21 01:01:01,759 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [21], [24], [25], [26], [28], [29], [30], [32], [33], [39], [41], [42], [43], [47], [48], [51], [125], [132], [133], [138], [143], [144], [145], [146] [2018-01-21 01:01:01,761 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:01:01,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:01:02,260 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:01:02,261 INFO L268 AbstractInterpreter]: Visited 32 different actions 98 times. Merged at 20 different actions 58 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 38 variables. [2018-01-21 01:01:02,281 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:01:02,281 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:01:02,281 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 01:01:02,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:02,289 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:01:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:02,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:01:02,445 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int)) (= (store |c_old(#valid)| |main_#t~malloc0.base| 1) |c_#valid|)) is different from true [2018-01-21 01:01:02,462 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int) (|main_#t~malloc4.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc4.base| 1)) (= (select .cse0 |main_#t~malloc4.base|) 0)))) is different from true [2018-01-21 01:01:02,479 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int) (v_prenex_1 Int) (|main_#t~malloc4.base| Int)) (let ((.cse1 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (let ((.cse0 (store .cse1 v_prenex_1 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc4.base| 1)) (= (select .cse1 v_prenex_1) 0) (= (select .cse0 |main_#t~malloc4.base|) 0))))) is different from true [2018-01-21 01:01:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2018-01-21 01:01:02,506 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:01:02,612 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 26 DAG size of output 24 [2018-01-21 01:01:02,658 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_21| Int)) (or (not (= (select |c_#valid| |v_main_#t~malloc4.base_21|) 0)) (not (= |c_old(#valid)| (store |c_#valid| |v_main_#t~malloc4.base_21| 1))))) is different from false [2018-01-21 01:01:02,675 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_21| Int) (|v_main_#t~malloc4.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc4.base_22| 1))) (or (not (= (store .cse0 |v_main_#t~malloc4.base_21| 1) |c_old(#valid)|)) (not (= (select |c_#valid| |v_main_#t~malloc4.base_22|) 0)) (not (= 0 (select .cse0 |v_main_#t~malloc4.base_21|)))))) is different from false [2018-01-21 01:01:02,682 WARN L1007 $PredicateComparison]: unable to prove that (or (= c_main_~flag~6 0) (forall ((|v_main_#t~malloc4.base_21| Int) (|v_main_#t~malloc4.base_22| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc4.base_22| 1))) (or (not (= (store .cse0 |v_main_#t~malloc4.base_21| 1) |c_old(#valid)|)) (not (= (select |c_#valid| |v_main_#t~malloc4.base_22|) 0)) (not (= 0 (select .cse0 |v_main_#t~malloc4.base_21|))))))) is different from false [2018-01-21 01:01:02,693 WARN L1007 $PredicateComparison]: unable to prove that (or (= c_main_~flag~6 0) (forall ((|v_main_#t~malloc4.base_21| Int) (|v_main_#t~malloc0.base_14| Int) (|v_main_#t~malloc4.base_22| Int)) (let ((.cse1 (store |c_#valid| |v_main_#t~malloc0.base_14| 1))) (let ((.cse0 (store .cse1 |v_main_#t~malloc4.base_22| 1))) (or (not (= (store .cse0 |v_main_#t~malloc4.base_21| 1) |c_old(#valid)|)) (not (= 0 (select .cse1 |v_main_#t~malloc4.base_22|))) (not (= (select .cse0 |v_main_#t~malloc4.base_21|) 0))))))) is different from false [2018-01-21 01:01:02,697 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_21| Int) (|v_main_#t~malloc0.base_14| Int) (|v_main_#t~malloc4.base_22| Int)) (let ((.cse1 (store |c_#valid| |v_main_#t~malloc0.base_14| 1))) (let ((.cse0 (store .cse1 |v_main_#t~malloc4.base_22| 1))) (or (not (= (store .cse0 |v_main_#t~malloc4.base_21| 1) |c_old(#valid)|)) (not (= 0 (select .cse1 |v_main_#t~malloc4.base_22|))) (not (= (select .cse0 |v_main_#t~malloc4.base_21|) 0)))))) is different from false [2018-01-21 01:01:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2018-01-21 01:01:02,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:01:02,725 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:01:02,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:02,729 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:01:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:02,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:01:02,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 01:01:02,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:01:02,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:02,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:02,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:02,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-21 01:01:03,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:01:03,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 01:01:03,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-21 01:01:03,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:03,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-21 01:01:03,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:36 [2018-01-21 01:01:03,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-21 01:01:03,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2018-01-21 01:01:03,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-01-21 01:01:03,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:03,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-21 01:01:03,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:01:03,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-21 01:01:03,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-21 01:01:03,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:36 [2018-01-21 01:01:03,319 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:03,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-21 01:01:03,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:03,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-21 01:01:03,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:01:03,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 01:01:03,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,413 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:42 [2018-01-21 01:01:03,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-21 01:01:03,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-01-21 01:01:03,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:03,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:36 [2018-01-21 01:01:03,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:03,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 57 [2018-01-21 01:01:03,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-01-21 01:01:03,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:03,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-01-21 01:01:03,629 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-21 01:01:03,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:03,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-01-21 01:01:03,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-21 01:01:03,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:01:03,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-01-21 01:01:03,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:47, output treesize:116 [2018-01-21 01:01:03,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:03,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-01-21 01:01:03,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:01:03,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-21 01:01:03,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:03,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:04,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-01-21 01:01:04,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-21 01:01:04,005 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:01:04,016 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,022 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:04,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 59 [2018-01-21 01:01:04,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-01-21 01:01:04,064 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-01-21 01:01:04,125 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-01-21 01:01:04,173 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-01-21 01:01:04,214 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,254 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:04,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:04,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:04,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:04,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:04,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:04,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-01-21 01:01:04,258 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:04,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:04,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-01-21 01:01:04,298 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-01-21 01:01:04,336 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:04,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:04,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-21 01:01:04,373 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,401 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:01:04,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-2 vars, End of recursive call: 13 dim-0 vars, and 5 xjuncts. [2018-01-21 01:01:04,435 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 14 variables, input treesize:128, output treesize:127 [2018-01-21 01:01:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:01:04,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:01:04,692 WARN L143 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 100 [2018-01-21 01:01:04,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:04,902 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:04,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:04,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:01:04,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-01-21 01:01:04,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-21 01:01:04,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:05,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2018-01-21 01:01:05,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:05,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-21 01:01:05,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:32 [2018-01-21 01:01:05,286 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:05,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:05,293 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:05,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:05,316 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:05,317 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:05,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-01-21 01:01:05,338 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:76, output treesize:72 [2018-01-21 01:01:09,454 WARN L146 SmtUtils]: Spent 4042ms on a formula simplification. DAG size of input: 52 DAG size of output 52 [2018-01-21 01:01:11,536 WARN L143 SmtUtils]: Spent 2020ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-21 01:01:13,629 WARN L143 SmtUtils]: Spent 2041ms on a formula simplification that was a NOOP. DAG size: 65 [2018-01-21 01:01:13,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-21 01:01:13,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-21 01:01:13,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:13,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:13,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-01-21 01:01:13,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-21 01:01:13,698 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,698 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-21 01:01:13,699 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:13,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-21 01:01:13,701 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:13,708 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:01:13,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:01:13,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-01-21 01:01:13,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-21 01:01:13,766 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,766 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-21 01:01:13,767 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:13,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-21 01:01:13,770 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:13,783 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:01:13,802 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:01:13,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-01-21 01:01:13,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-01-21 01:01:13,810 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-01-21 01:01:13,815 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,820 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 49 [2018-01-21 01:01:13,917 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,917 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,917 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,918 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-21 01:01:13,920 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:13,921 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-01-21 01:01:13,923 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:13,969 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,969 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,970 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,971 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,972 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,972 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,973 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2018-01-21 01:01:13,981 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-01-21 01:01:13,983 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,984 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,984 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:13,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-01-21 01:01:13,990 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-01-21 01:01:14,054 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:14,055 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:14,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-01-21 01:01:14,055 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:14,057 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:14,057 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:14,058 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:14,058 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:14,058 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:14,058 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:01:14,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-01-21 01:01:14,059 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:14,090 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:01:14,107 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:01:14,122 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:01:14,141 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:01:14,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 8 xjuncts. [2018-01-21 01:01:14,194 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 10 variables, input treesize:90, output treesize:136 [2018-01-21 01:01:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:01:16,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:01:16,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 22, 21] total 56 [2018-01-21 01:01:16,511 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:01:16,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-21 01:01:16,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-21 01:01:16,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2007, Unknown=12, NotChecked=792, Total=3080 [2018-01-21 01:01:16,513 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 13 states. [2018-01-21 01:01:16,665 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_main_#t~malloc4.base|))) (and (not (= .cse0 0)) (exists ((|main_#t~malloc0.base| Int) (|main_#t~malloc4.base| Int)) (let ((.cse1 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (and (= |c_#valid| (store .cse1 |main_#t~malloc4.base| 1)) (= (select .cse1 |main_#t~malloc4.base|) 0)))) (not (= .cse0 (select |c_old(#valid)| |c_main_#t~malloc4.base|))))) is different from true [2018-01-21 01:01:16,720 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_main_#t~malloc4.base|))) (and (not (= .cse0 0)) (exists ((|main_#t~malloc0.base| Int) (v_prenex_1 Int) (|main_#t~malloc4.base| Int)) (let ((.cse2 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (let ((.cse1 (store .cse2 v_prenex_1 1))) (and (= |c_#valid| (store .cse1 |main_#t~malloc4.base| 1)) (= (select .cse2 v_prenex_1) 0) (= (select .cse1 |main_#t~malloc4.base|) 0))))) (not (= .cse0 (select |c_old(#valid)| |c_main_#t~malloc4.base|))))) is different from true [2018-01-21 01:01:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:01:16,837 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2018-01-21 01:01:16,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 01:01:16,838 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-01-21 01:01:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:01:16,840 INFO L225 Difference]: With dead ends: 204 [2018-01-21 01:01:16,840 INFO L226 Difference]: Without dead ends: 130 [2018-01-21 01:01:16,843 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=331, Invalid=2340, Unknown=21, NotChecked=1090, Total=3782 [2018-01-21 01:01:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-21 01:01:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2018-01-21 01:01:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-21 01:01:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-01-21 01:01:16,854 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 43 [2018-01-21 01:01:16,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:01:16,855 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-01-21 01:01:16,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-21 01:01:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-01-21 01:01:16,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-21 01:01:16,857 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:01:16,857 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2018-01-21 01:01:16,857 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:01:16,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1991013201, now seen corresponding path program 2 times [2018-01-21 01:01:16,858 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:01:16,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:16,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:01:16,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:01:16,859 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:01:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:01:16,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:01:17,478 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 43 DAG size of output 35 [2018-01-21 01:01:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:01:17,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:01:17,854 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:01:17,854 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 01:01:17,854 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 01:01:17,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:01:17,855 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 01:01:17,864 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 01:01:17,864 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 01:01:17,883 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:01:17,896 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:01:17,902 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 01:01:17,906 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:01:17,949 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int)) (= |c_#valid| (store |c_old(#valid)| main_~p~6.base 1))) is different from true [2018-01-21 01:01:17,956 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (|main_#t~malloc4.base| Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~6.base 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc4.base| 1)) (= 0 (select .cse0 |main_#t~malloc4.base|))))) is different from true [2018-01-21 01:01:17,972 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_prenex_41 Int)) (let ((.cse1 (store |c_old(#valid)| main_~p~6.base 1))) (let ((.cse0 (store .cse1 v_prenex_41 1))) (and (= |c_#valid| (store .cse0 |c_main_#t~malloc4.base| 1)) (= 0 (select .cse0 |c_main_#t~malloc4.base|)) (= 0 (select .cse1 v_prenex_41)))))) is different from true [2018-01-21 01:01:17,975 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_prenex_41 Int)) (let ((.cse1 (store |c_old(#valid)| main_~p~6.base 1))) (let ((.cse0 (store .cse1 v_prenex_41 1))) (and (= |c_#valid| (store .cse0 c_main_~t~6.base 1)) (= 0 (select .cse0 c_main_~t~6.base)) (= 0 (select .cse1 v_prenex_41)))))) is different from true [2018-01-21 01:01:17,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:01:17,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 01:01:17,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:17,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:18,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:18,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:44 [2018-01-21 01:01:18,011 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_42 1))) (let ((.cse0 (store .cse2 v_prenex_41 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_main_~p~6.base) (+ c_main_~p~6.offset 4)))) (and (= (select .cse0 .cse1) 0) (= 0 (select .cse2 v_prenex_41)) (= |c_#valid| (store .cse0 .cse1 1)))))) is different from true [2018-01-21 01:01:18,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-21 01:01:18,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-01-21 01:01:18,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:18,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:18,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:18,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:53, output treesize:32 [2018-01-21 01:01:18,040 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_42 1))) (let ((.cse0 (store .cse1 v_prenex_41 1))) (and (= (select .cse0 |c_main_#t~mem6.base|) 0) (= 0 (select .cse1 v_prenex_41)) (= |c_#valid| (store .cse0 |c_main_#t~mem6.base| 1)))))) is different from true [2018-01-21 01:01:18,044 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_42 1))) (let ((.cse0 (store .cse1 v_prenex_41 1))) (and (= |c_#valid| (store .cse0 c_main_~p~6.base 1)) (= (select .cse0 c_main_~p~6.base) 0) (= 0 (select .cse1 v_prenex_41)))))) is different from true [2018-01-21 01:01:18,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:01:18,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 01:01:18,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:18,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:18,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:18,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:61 [2018-01-21 01:01:18,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-01-21 01:01:18,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2018-01-21 01:01:18,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:18,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:18,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:18,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:70, output treesize:49 [2018-01-21 01:01:18,161 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_prenex_41 Int) (v_prenex_42 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_42 1))) (let ((.cse0 (store .cse2 v_prenex_41 1))) (let ((.cse1 (store .cse0 main_~p~6.base 1))) (and (= (select .cse0 main_~p~6.base) 0) (= (select .cse1 |c_main_#t~mem6.base|) 0) (= 0 (select .cse2 v_prenex_41)) (= |c_#valid| (store .cse1 |c_main_#t~mem6.base| 1))))))) is different from true [2018-01-21 01:01:18,165 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_41 Int) (v_subst_4 Int) (v_prenex_42 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_42 1))) (let ((.cse1 (store .cse2 v_prenex_41 1))) (let ((.cse0 (store .cse1 v_subst_4 1))) (and (= |c_#valid| (store .cse0 c_main_~p~6.base 1)) (= (select .cse1 v_subst_4) 0) (= 0 (select .cse2 v_prenex_41)) (= 0 (select .cse0 c_main_~p~6.base))))))) is different from true [2018-01-21 01:01:18,181 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_41 Int) (v_subst_4 Int) (v_prenex_42 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_42 1))) (let ((.cse0 (store .cse1 v_prenex_41 1))) (let ((.cse2 (store .cse0 v_subst_4 1))) (and (= (select .cse0 v_subst_4) 0) (= 0 (select .cse1 v_prenex_41)) (= |c_#valid| (store (store .cse2 c_main_~p~6.base 1) |c_main_#t~malloc4.base| 1)) (= 0 (select .cse2 c_main_~p~6.base))))))) is different from true [2018-01-21 01:01:18,190 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_41 Int) (v_subst_4 Int) (v_prenex_42 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_42 1))) (let ((.cse1 (store .cse2 v_prenex_41 1))) (let ((.cse0 (store .cse1 v_subst_4 1))) (and (= (store (store .cse0 c_main_~p~6.base 1) c_main_~t~6.base 1) |c_#valid|) (= (select .cse1 v_subst_4) 0) (= 0 (select .cse2 v_prenex_41)) (= 0 (select .cse0 c_main_~p~6.base))))))) is different from true [2018-01-21 01:01:18,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:01:18,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 01:01:18,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:18,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:18,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:18,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:58 [2018-01-21 01:01:18,264 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_41 Int) (v_subst_4 Int) (v_prenex_42 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_42 1))) (let ((.cse0 (store .cse1 v_prenex_41 1))) (let ((.cse2 (store .cse0 v_subst_4 1))) (and (= (select .cse0 v_subst_4) 0) (= 0 (select .cse1 v_prenex_41)) (= |c_#valid| (store (store .cse2 c_main_~p~6.base 1) (select (select |c_#memory_$Pointer$.base| c_main_~p~6.base) (+ c_main_~p~6.offset 4)) 1)) (= 0 (select .cse2 c_main_~p~6.base))))))) is different from true [2018-01-21 01:01:18,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-01-21 01:01:18,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-01-21 01:01:18,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:18,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:18,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:18,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:67, output treesize:52 [2018-01-21 01:01:18,389 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_prenex_41 Int) (v_subst_4 Int) (v_prenex_42 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_42 1))) (let ((.cse1 (store .cse2 v_prenex_41 1))) (let ((.cse0 (store .cse1 v_subst_4 1))) (and (= |c_#valid| (store (store .cse0 main_~p~6.base 1) |c_main_#t~mem6.base| 1)) (= (select .cse1 v_subst_4) 0) (= 0 (select .cse2 v_prenex_41)) (= 0 (select .cse0 main_~p~6.base))))))) is different from true [2018-01-21 01:01:18,421 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_prenex_41 Int) (v_subst_5 Int) (v_subst_4 Int) (v_prenex_42 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_42 1))) (let ((.cse1 (store .cse2 v_prenex_41 1))) (let ((.cse0 (store .cse1 v_subst_4 1))) (and (= 0 (select .cse0 v_subst_5)) (= |c_#valid| (store (store .cse0 v_subst_5 1) main_~p~6.base 1)) (= (select .cse1 v_subst_4) 0) (= 0 (select .cse2 v_prenex_41))))))) is different from true [2018-01-21 01:01:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 76 not checked. [2018-01-21 01:01:18,458 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:01:18,733 WARN L143 SmtUtils]: Spent 271ms on a formula simplification that was a NOOP. DAG size: 86 [2018-01-21 01:01:18,767 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_36| Int)) (not (= (store |c_#valid| |v_main_#t~malloc4.base_36| 1) |c_old(#valid)|))) is different from false [2018-01-21 01:01:18,774 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_37| Int) (|v_main_#t~malloc4.base_36| Int)) (or (not (= (store (store |c_#valid| |v_main_#t~malloc4.base_37| 1) |v_main_#t~malloc4.base_36| 1) |c_old(#valid)|)) (not (= (select |c_#valid| |v_main_#t~malloc4.base_37|) 0)))) is different from false [2018-01-21 01:01:18,788 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_38| Int) (|v_main_#t~malloc4.base_37| Int) (|v_main_#t~malloc4.base_36| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc4.base_38| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc4.base_38|) 0)) (not (= (store (store .cse0 |v_main_#t~malloc4.base_37| 1) |v_main_#t~malloc4.base_36| 1) |c_old(#valid)|)) (not (= (select .cse0 |v_main_#t~malloc4.base_37|) 0))))) is different from false [2018-01-21 01:01:18,803 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_38| Int) (|v_main_#t~malloc4.base_37| Int) (|v_main_#t~malloc4.base_39| Int) (|v_main_#t~malloc4.base_36| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc4.base_39| 1))) (let ((.cse1 (store .cse0 |v_main_#t~malloc4.base_38| 1))) (or (not (= (select .cse0 |v_main_#t~malloc4.base_38|) 0)) (not (= (select .cse1 |v_main_#t~malloc4.base_37|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc4.base_39|))) (not (= |c_old(#valid)| (store (store .cse1 |v_main_#t~malloc4.base_37| 1) |v_main_#t~malloc4.base_36| 1))))))) is different from false [2018-01-21 01:01:18,834 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc4.base_38| Int) (|v_main_#t~malloc4.base_37| Int) (|v_main_#t~malloc4.base_39| Int) (|v_main_#t~malloc0.base_22| Int) (|v_main_#t~malloc4.base_36| Int)) (let ((.cse2 (store |c_#valid| |v_main_#t~malloc0.base_22| 1))) (let ((.cse0 (store .cse2 |v_main_#t~malloc4.base_39| 1))) (let ((.cse1 (store .cse0 |v_main_#t~malloc4.base_38| 1))) (or (not (= 0 (select .cse0 |v_main_#t~malloc4.base_38|))) (not (= (select .cse1 |v_main_#t~malloc4.base_37|) 0)) (not (= (store (store .cse1 |v_main_#t~malloc4.base_37| 1) |v_main_#t~malloc4.base_36| 1) |c_old(#valid)|)) (not (= (select .cse2 |v_main_#t~malloc4.base_39|) 0))))))) is different from false [2018-01-21 01:01:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 76 not checked. [2018-01-21 01:01:18,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:01:18,878 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:01:18,888 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 01:01:18,889 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 01:01:18,908 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:01:18,934 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:01:18,970 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 01:01:18,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:01:19,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 01:01:19,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:01:19,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-21 01:01:19,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-21 01:01:19,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:19,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-21 01:01:19,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:01:19,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 01:01:19,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,420 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:51 [2018-01-21 01:01:19,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-01-21 01:01:19,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-01-21 01:01:19,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:33 [2018-01-21 01:01:19,553 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:19,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-21 01:01:19,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:01:19,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-01-21 01:01:19,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:19,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-21 01:01:19,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:19,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-21 01:01:19,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:01:19,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 01:01:19,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:66 [2018-01-21 01:01:19,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-21 01:01:19,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-01-21 01:01:19,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:19,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:19,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:54 [2018-01-21 01:01:20,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,043 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-01-21 01:01:20,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:01:20,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:20,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:61 [2018-01-21 01:01:20,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:01:20,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 01:01:20,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-01-21 01:01:20,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-21 01:01:20,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:20,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:69 [2018-01-21 01:01:20,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-01-21 01:01:20,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-01-21 01:01:20,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:20,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:63 [2018-01-21 01:01:20,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,710 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-01-21 01:01:20,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:01:20,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:20,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:70 [2018-01-21 01:01:20,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-21 01:01:20,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:20,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:75 [2018-01-21 01:01:20,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:01:20,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 01:01:20,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:20,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,994 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:20,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:21,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 67 [2018-01-21 01:01:21,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:21,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-21 01:01:21,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:21,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:21,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:21,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:107, output treesize:81 [2018-01-21 01:01:21,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-21 01:01:21,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-01-21 01:01:21,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:21,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:21,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:21,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:90, output treesize:75 [2018-01-21 01:01:21,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:21,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:21,296 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:21,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:21,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:21,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:21,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 40 treesize of output 121 [2018-01-21 01:01:21,350 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-01-21 01:01:21,385 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 01:01:21,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:22,938 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:22,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 43 [2018-01-21 01:01:22,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-21 01:01:23,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:23,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 43 [2018-01-21 01:01:23,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-21 01:01:23,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-01-21 01:01:23,566 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:23,700 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:23,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 43 [2018-01-21 01:01:23,706 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-21 01:01:24,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:24,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 43 [2018-01-21 01:01:24,114 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-21 01:01:24,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 16 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-21 01:01:24,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 32 dim-0 vars, and 5 xjuncts. [2018-01-21 01:01:24,343 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:86, output treesize:383 [2018-01-21 01:01:25,278 WARN L146 SmtUtils]: Spent 696ms on a formula simplification. DAG size of input: 165 DAG size of output 137 [2018-01-21 01:01:25,290 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:25,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:25,292 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:25,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:25,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:25,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:25,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 93 [2018-01-21 01:01:25,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-21 01:01:25,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:25,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:01:25,324 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:25,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:01:25,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:25,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:01:25,347 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:25,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:25,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:25,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:25,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:25,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:25,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:25,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:25,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 130 [2018-01-21 01:01:25,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 109 [2018-01-21 01:01:25,448 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:25,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 80 [2018-01-21 01:01:25,998 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:26,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,406 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,408 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2018-01-21 01:01:26,420 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:26,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:26,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2018-01-21 01:01:26,837 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:27,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:27,265 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:27,266 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:27,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:27,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:27,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:27,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:27,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:27,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2018-01-21 01:01:27,272 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:27,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 81 [2018-01-21 01:01:27,688 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:28,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2018-01-21 01:01:28,094 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:28,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:28,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:28,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-01-21 01:01:28,504 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:28,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 81 [2018-01-21 01:01:28,915 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:29,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-01-21 01:01:29,321 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:29,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2018-01-21 01:01:29,722 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:30,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:30,121 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:30,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-01-21 01:01:30,122 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:30,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 81 [2018-01-21 01:01:30,484 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:30,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-01-21 01:01:30,857 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:31,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2018-01-21 01:01:31,213 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:31,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:31,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:31,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:31,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:31,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:31,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:31,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:31,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:31,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2018-01-21 01:01:31,887 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:32,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2018-01-21 01:01:32,566 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:33,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 71 [2018-01-21 01:01:33,171 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:33,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-01-21 01:01:33,466 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:33,756 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:33,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:33,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 75 [2018-01-21 01:01:33,758 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:34,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:34,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:34,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:34,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:34,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:34,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:34,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 80 [2018-01-21 01:01:34,056 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:34,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-01-21 01:01:34,389 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:34,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2018-01-21 01:01:34,670 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:34,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-01-21 01:01:34,949 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:35,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:35,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:35,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:35,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-01-21 01:01:35,193 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:35,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:35,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:35,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:35,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:35,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:35,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:35,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:35,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:35,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 71 [2018-01-21 01:01:35,474 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:35,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-01-21 01:01:35,712 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:35,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-01-21 01:01:35,952 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:36,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-01-21 01:01:36,149 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:36,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:36,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:36,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:36,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:36,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:36,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:36,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 80 [2018-01-21 01:01:36,729 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:36,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:36,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:36,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:36,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2018-01-21 01:01:36,930 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:37,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-01-21 01:01:37,120 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:37,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-01-21 01:01:37,303 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:37,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2018-01-21 01:01:37,501 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:37,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:37,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:37,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:37,680 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:37,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:37,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:37,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 79 [2018-01-21 01:01:37,683 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:37,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-01-21 01:01:37,863 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:38,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2018-01-21 01:01:38,039 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:38,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-01-21 01:01:38,213 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:38,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-01-21 01:01:38,374 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:38,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-01-21 01:01:38,674 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:38,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-01-21 01:01:38,800 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:38,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-01-21 01:01:38,922 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:39,001 INFO L267 ElimStorePlain]: Start of recursive call 7: 48 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-21 01:01:39,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:39,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:39,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:39,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:39,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:39,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:39,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 93 [2018-01-21 01:01:39,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:01:39,148 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:39,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:01:39,171 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:39,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:01:39,183 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:39,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-21 01:01:39,194 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:39,201 INFO L267 ElimStorePlain]: Start of recursive call 50: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:39,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:39,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:39,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:39,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:39,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:39,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:01:39,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 93 [2018-01-21 01:01:39,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:01:39,330 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:39,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-21 01:01:39,350 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:39,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:01:39,362 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:39,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-21 01:01:39,372 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:39,380 INFO L267 ElimStorePlain]: Start of recursive call 55: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:39,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 30 dim-0 vars, 4 dim-2 vars, End of recursive call: 37 dim-0 vars, and 8 xjuncts. [2018-01-21 01:01:39,488 INFO L202 ElimStorePlain]: Needed 59 recursive calls to eliminate 34 variables, input treesize:324, output treesize:441 [2018-01-21 01:01:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:01:39,987 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:01:40,939 WARN L143 SmtUtils]: Spent 950ms on a formula simplification that was a NOOP. DAG size: 168 [2018-01-21 01:01:41,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:41,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:41,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:41,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:41,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 01:01:41,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-01-21 01:01:41,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2018-01-21 01:01:41,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:41,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-21 01:01:41,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:41,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-21 01:01:41,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:32 [2018-01-21 01:01:41,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:41,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:41,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:41,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:41,848 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:41,853 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:41,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-01-21 01:01:41,870 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:76, output treesize:72 [2018-01-21 01:01:46,008 WARN L146 SmtUtils]: Spent 4045ms on a formula simplification. DAG size of input: 52 DAG size of output 52 [2018-01-21 01:01:48,129 WARN L143 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-21 01:01:50,249 WARN L143 SmtUtils]: Spent 2026ms on a formula simplification that was a NOOP. DAG size: 65 [2018-01-21 01:01:52,392 WARN L143 SmtUtils]: Spent 2037ms on a formula simplification that was a NOOP. DAG size: 69 [2018-01-21 01:01:54,840 WARN L143 SmtUtils]: Spent 2318ms on a formula simplification that was a NOOP. DAG size: 69 [2018-01-21 01:01:57,156 WARN L143 SmtUtils]: Spent 2182ms on a formula simplification that was a NOOP. DAG size: 74 [2018-01-21 01:01:57,228 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:57,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:57,236 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:57,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:57,302 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:01:57,305 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:01:57,348 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:57,355 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:57,356 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:57,362 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:01:57,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-2 vars, End of recursive call: 19 dim-0 vars, and 5 xjuncts. [2018-01-21 01:01:57,398 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 13 variables, input treesize:150, output treesize:184 Received shutdown request... [2018-01-21 01:02:03,651 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-21 01:02:03,651 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 01:02:03,653 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:02:03,653 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:02:03,653 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:02:03,653 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:02:03,653 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:02:03,654 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:02:03,654 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:02:03,654 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 01:02:03,654 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:02:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-21 01:02:03,655 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 01:02:03,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 01:02:03 BoogieIcfgContainer [2018-01-21 01:02:03,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 01:02:03,657 INFO L168 Benchmark]: Toolchain (without parser) took 65107.97 ms. Allocated memory was 299.4 MB in the beginning and 706.2 MB in the end (delta: 406.8 MB). Free memory was 259.3 MB in the beginning and 465.2 MB in the end (delta: -205.9 MB). Peak memory consumption was 201.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:02:03,658 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 299.4 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:02:03,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.72 ms. Allocated memory is still 299.4 MB. Free memory was 258.3 MB in the beginning and 247.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-21 01:02:03,659 INFO L168 Benchmark]: Boogie Preprocessor took 40.01 ms. Allocated memory is still 299.4 MB. Free memory was 247.2 MB in the beginning and 246.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-21 01:02:03,659 INFO L168 Benchmark]: RCFGBuilder took 385.21 ms. Allocated memory is still 299.4 MB. Free memory was 245.2 MB in the beginning and 223.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:02:03,659 INFO L168 Benchmark]: TraceAbstraction took 64454.76 ms. Allocated memory was 299.4 MB in the beginning and 706.2 MB in the end (delta: 406.8 MB). Free memory was 223.3 MB in the beginning and 465.2 MB in the end (delta: -241.9 MB). Peak memory consumption was 164.9 MB. Max. memory is 5.3 GB. [2018-01-21 01:02:03,661 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 299.4 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.72 ms. Allocated memory is still 299.4 MB. Free memory was 258.3 MB in the beginning and 247.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.01 ms. Allocated memory is still 299.4 MB. Free memory was 247.2 MB in the beginning and 246.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 385.21 ms. Allocated memory is still 299.4 MB. Free memory was 245.2 MB in the beginning and 223.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64454.76 ms. Allocated memory was 299.4 MB in the beginning and 706.2 MB in the end (delta: 406.8 MB). Free memory was 223.3 MB in the beginning and 465.2 MB in the end (delta: -241.9 MB). Peak memory consumption was 164.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 287 LocStat_NO_SUPPORTING_DISEQUALITIES : 101 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.155449 RENAME_VARIABLES(MILLISECONDS) : 0.094723 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.118948 PROJECTAWAY(MILLISECONDS) : 0.052038 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001424 DISJOIN(MILLISECONDS) : 0.901705 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.118087 ADD_EQUALITY(MILLISECONDS) : 0.039616 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.029196 #CONJOIN_DISJUNCTIVE : 64 #RENAME_VARIABLES : 106 #UNFREEZE : 0 #CONJOIN : 105 #PROJECTAWAY : 88 #ADD_WEAK_EQUALITY : 23 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 104 #ADD_EQUALITY : 64 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 271 LocStat_NO_SUPPORTING_DISEQUALITIES : 130 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 53 TransStat_NO_SUPPORTING_DISEQUALITIES : 15 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.781696 RENAME_VARIABLES(MILLISECONDS) : 0.020861 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.554696 PROJECTAWAY(MILLISECONDS) : 1.897503 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001174 DISJOIN(MILLISECONDS) : 0.710421 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.042806 ADD_EQUALITY(MILLISECONDS) : 0.033290 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014936 #CONJOIN_DISJUNCTIVE : 180 #RENAME_VARIABLES : 354 #UNFREEZE : 0 #CONJOIN : 247 #PROJECTAWAY : 218 #ADD_WEAK_EQUALITY : 29 #DISJOIN : 39 #RENAME_VARIABLES_DISJUNCTIVE : 346 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 9 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 525]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: exitErr0EnsuresViolation CFG has 4 procedures, 67 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 13 PreInvPairs, 13 NumberOfFragments, 12 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 67 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1). Cancelled while BasicCegarLoop was analyzing trace of length 68 with TraceHistMax 5, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 67 locations, 4 error locations. TIMEOUT Result, 64.1s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 352 SDtfs, 225 SDslu, 686 SDs, 0 SdLazy, 158 SolverSat, 28 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 436 ConstructedInterpolants, 153 QuantifiedInterpolants, 243070 SizeOfPredicates, 44 NumberOfNonLiveVariables, 468 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 18/113 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while IsEmpty was searching accepting run (input had 64 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 67 locations, 4 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-02-03-670.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_01-02-03-670.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_01-02-03-670.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_01-02-03-670.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_01-02-03-670.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-02-03-670.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_01-02-03-670.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_01-02-03-670.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_01-02-03-670.csv Completed graceful shutdown