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/simple_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:00:52,509 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:00:52,511 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:00:52,527 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:00:52,528 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:00:52,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:00:52,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:00:52,531 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:00:52,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:00:52,534 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:00:52,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:00:52,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:00:52,536 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:00:52,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:00:52,538 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:00:52,541 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:00:52,543 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:00:52,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:00:52,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:00:52,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:00:52,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:00:52,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:00:52,550 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:00:52,551 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:00:52,552 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:00:52,553 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:00:52,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:00:52,554 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:00:52,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:00:52,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:00:52,555 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:00:52,556 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:52,565 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:00:52,566 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:00:52,567 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:00:52,567 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:00:52,567 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:00:52,567 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:00:52,567 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:00:52,568 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:00:52,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:00:52,569 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:00:52,569 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:00:52,569 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:00:52,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:00:52,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:00:52,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:00:52,570 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:00:52,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:00:52,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:00:52,570 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:00:52,571 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:00:52,571 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:00:52,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:00:52,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:00:52,571 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:00:52,572 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:00:52,572 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:00:52,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:00:52,572 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:00:52,572 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:00:52,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:00:52,573 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:00:52,573 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:00:52,573 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:00:52,573 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:00:52,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:00:52,574 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:00:52,574 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:00:52,575 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:00:52,575 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:00:52,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:00:52,623 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:00:52,627 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:00:52,629 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:00:52,629 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:00:52,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-01-21 01:00:52,800 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:00:52,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:00:52,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:00:52,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:00:52,815 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:00:52,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:00:52" (1/1) ... [2018-01-21 01:00:52,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3072b9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:52, skipping insertion in model container [2018-01-21 01:00:52,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:00:52" (1/1) ... [2018-01-21 01:00:52,838 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:00:52,877 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:00:52,983 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:00:52,997 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:00:53,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:53 WrapperNode [2018-01-21 01:00:53,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:00:53,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:00:53,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:00:53,005 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:00:53,016 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:53" (1/1) ... [2018-01-21 01:00:53,016 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:53" (1/1) ... [2018-01-21 01:00:53,027 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:53" (1/1) ... [2018-01-21 01:00:53,027 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:53" (1/1) ... [2018-01-21 01:00:53,030 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:53" (1/1) ... [2018-01-21 01:00:53,032 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:53" (1/1) ... [2018-01-21 01:00:53,033 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:53" (1/1) ... [2018-01-21 01:00:53,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:00:53,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:00:53,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:00:53,035 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:00:53,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:53" (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:53,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:00:53,086 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:00:53,086 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-21 01:00:53,086 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:00:53,086 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:00:53,087 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:00:53,087 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 01:00:53,087 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 01:00:53,087 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:00:53,087 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:00:53,087 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:00:53,087 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:00:53,087 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:00:53,087 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:00:53,087 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-21 01:00:53,088 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:00:53,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:00:53,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:00:53,260 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:00:53,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:00:53 BoogieIcfgContainer [2018-01-21 01:00:53,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:00:53,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:00:53,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:00:53,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:00:53,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:00:52" (1/3) ... [2018-01-21 01:00:53,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554dd9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:00:53, skipping insertion in model container [2018-01-21 01:00:53,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:53" (2/3) ... [2018-01-21 01:00:53,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554dd9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:00:53, skipping insertion in model container [2018-01-21 01:00:53,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:00:53" (3/3) ... [2018-01-21 01:00:53,288 INFO L105 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2018-01-21 01:00:53,295 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:00:53,301 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 01:00:53,335 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:00:53,336 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:00:53,336 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:00:53,336 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:00:53,336 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:00:53,336 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:00:53,336 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:00:53,336 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-21 01:00:53,337 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:00:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-21 01:00:53,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 01:00:53,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 41 states. [2018-01-21 01:00:53,439 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-21 01:00:53,439 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-21 01:00:53,439 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-21 01:00:53,439 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-21 01:00:53,440 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-21 01:00:53,440 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 648) no Hoare annotation was computed. [2018-01-21 01:00:53,440 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 648) no Hoare annotation was computed. [2018-01-21 01:00:53,440 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 648) the Hoare annotation is: true [2018-01-21 01:00:53,440 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 648) no Hoare annotation was computed. [2018-01-21 01:00:53,440 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 648) the Hoare annotation is: true [2018-01-21 01:00:53,440 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 648) no Hoare annotation was computed. [2018-01-21 01:00:53,440 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 648) the Hoare annotation is: true [2018-01-21 01:00:53,441 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 648) no Hoare annotation was computed. [2018-01-21 01:00:53,441 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 648) no Hoare annotation was computed. [2018-01-21 01:00:53,441 INFO L401 ceAbstractionStarter]: For program point L627(line 627) no Hoare annotation was computed. [2018-01-21 01:00:53,441 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-21 01:00:53,441 INFO L401 ceAbstractionStarter]: For program point L631'(lines 631 637) no Hoare annotation was computed. [2018-01-21 01:00:53,441 INFO L404 ceAbstractionStarter]: At program point L631'''(lines 631 637) the Hoare annotation is: true [2018-01-21 01:00:53,441 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 626 648) no Hoare annotation was computed. [2018-01-21 01:00:53,441 INFO L401 ceAbstractionStarter]: For program point L642'''(lines 642 644) no Hoare annotation was computed. [2018-01-21 01:00:53,441 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 648) no Hoare annotation was computed. [2018-01-21 01:00:53,441 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 648) the Hoare annotation is: true [2018-01-21 01:00:53,442 INFO L401 ceAbstractionStarter]: For program point L632'(line 632) no Hoare annotation was computed. [2018-01-21 01:00:53,442 INFO L401 ceAbstractionStarter]: For program point L631''''(lines 631 637) no Hoare annotation was computed. [2018-01-21 01:00:53,442 INFO L404 ceAbstractionStarter]: At program point L628'(line 628) the Hoare annotation is: true [2018-01-21 01:00:53,442 INFO L401 ceAbstractionStarter]: For program point L641(lines 641 646) no Hoare annotation was computed. [2018-01-21 01:00:53,442 INFO L404 ceAbstractionStarter]: At program point L641''(lines 641 646) the Hoare annotation is: true [2018-01-21 01:00:53,442 INFO L401 ceAbstractionStarter]: For program point L645(line 645) no Hoare annotation was computed. [2018-01-21 01:00:53,442 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-21 01:00:53,442 INFO L401 ceAbstractionStarter]: For program point L642(line 642) no Hoare annotation was computed. [2018-01-21 01:00:53,442 INFO L401 ceAbstractionStarter]: For program point L628'''(line 628) no Hoare annotation was computed. [2018-01-21 01:00:53,442 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 648) no Hoare annotation was computed. [2018-01-21 01:00:53,443 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-21 01:00:53,443 INFO L401 ceAbstractionStarter]: For program point L633(line 633) no Hoare annotation was computed. [2018-01-21 01:00:53,443 INFO L401 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-21 01:00:53,443 INFO L401 ceAbstractionStarter]: For program point L631(lines 631 637) no Hoare annotation was computed. [2018-01-21 01:00:53,443 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-21 01:00:53,443 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-21 01:00:53,443 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-21 01:00:53,443 INFO L401 ceAbstractionStarter]: For program point L641'''(lines 641 646) no Hoare annotation was computed. [2018-01-21 01:00:53,443 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-21 01:00:53,443 INFO L404 ceAbstractionStarter]: At program point L634'(line 634) the Hoare annotation is: true [2018-01-21 01:00:53,443 INFO L401 ceAbstractionStarter]: For program point L642'(line 642) no Hoare annotation was computed. [2018-01-21 01:00:53,444 INFO L401 ceAbstractionStarter]: For program point L634'''(line 634) no Hoare annotation was computed. [2018-01-21 01:00:53,448 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:00:53,448 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:00:53,448 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:00:53,448 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:00:53,448 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:00:53,449 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:00:53,449 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:00:53,449 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:00:53,449 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:00:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-21 01:00:53,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:00:53,452 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:53,453 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:00:53,453 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:00:53,458 INFO L82 PathProgramCache]: Analyzing trace with hash 111860, now seen corresponding path program 1 times [2018-01-21 01:00:53,461 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:53,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:53,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:53,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:53,484 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:00:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:00:53,532 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:00:53,536 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:00:53,542 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:00:53,542 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:00:53,542 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:00:53,542 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:00:53,542 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:00:53,542 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:00:53,542 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:00:53,543 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:00:53,543 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:00:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-21 01:00:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 01:00:53,546 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:53,546 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:00:53,546 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:53,547 INFO L82 PathProgramCache]: Analyzing trace with hash 531101053, now seen corresponding path program 1 times [2018-01-21 01:00:53,547 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:53,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:53,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:53,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:53,549 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:53,573 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:53,609 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:53,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:00:53,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:00:53,611 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:00:53,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:00:53,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:00:53,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:00:53,632 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-01-21 01:00:53,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:00:53,710 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-01-21 01:00:53,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:00:53,711 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 01:00:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:00:53,719 INFO L225 Difference]: With dead ends: 58 [2018-01-21 01:00:53,719 INFO L226 Difference]: Without dead ends: 33 [2018-01-21 01:00:53,721 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:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-21 01:00:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-21 01:00:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-21 01:00:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-01-21 01:00:53,750 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 18 [2018-01-21 01:00:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:00:53,750 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-01-21 01:00:53,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:00:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-01-21 01:00:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 01:00:53,751 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:53,751 INFO L322 BasicCegarLoop]: trace histogram [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:53,751 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash 403826474, now seen corresponding path program 1 times [2018-01-21 01:00:53,751 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:53,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:53,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:53,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:53,753 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:53,778 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:53,851 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:53,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:00:53,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 01:00:53,851 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:00:53,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 01:00:53,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 01:00:53,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 01:00:53,854 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 5 states. [2018-01-21 01:00:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:00:53,959 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-01-21 01:00:53,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 01:00:53,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-21 01:00:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:00:53,961 INFO L225 Difference]: With dead ends: 57 [2018-01-21 01:00:53,961 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 01:00:53,963 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 01:00:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 01:00:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 35. [2018-01-21 01:00:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-21 01:00:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-01-21 01:00:53,969 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 21 [2018-01-21 01:00:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:00:53,970 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-01-21 01:00:53,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 01:00:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-01-21 01:00:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 01:00:53,971 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:53,971 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-21 01:00:53,971 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1062535480, now seen corresponding path program 1 times [2018-01-21 01:00:53,972 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:53,972 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:53,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:53,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:53,973 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:53,989 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:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:00:54,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:00:54,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 01:00:54,051 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:00:54,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 01:00:54,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 01:00:54,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 01:00:54,052 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 4 states. [2018-01-21 01:00:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:00:54,094 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-01-21 01:00:54,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 01:00:54,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-21 01:00:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:00:54,096 INFO L225 Difference]: With dead ends: 56 [2018-01-21 01:00:54,096 INFO L226 Difference]: Without dead ends: 40 [2018-01-21 01:00:54,097 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:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-21 01:00:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-21 01:00:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 01:00:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-01-21 01:00:54,103 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 27 [2018-01-21 01:00:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:00:54,104 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-01-21 01:00:54,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 01:00:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-01-21 01:00:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 01:00:54,105 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:54,105 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:00:54,105 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:54,106 INFO L82 PathProgramCache]: Analyzing trace with hash -571757697, now seen corresponding path program 1 times [2018-01-21 01:00:54,106 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:54,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:54,107 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:54,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:54,107 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:54,136 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:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:00:54,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:54,260 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:00:54,261 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-21 01:00:54,263 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [9], [13], [15], [18], [20], [21], [22], [23], [29], [31], [32], [33], [37], [38], [39], [43], [47], [49], [50], [57], [59], [60], [64], [65], [72], [73], [78], [83], [84], [85], [86] [2018-01-21 01:00:54,311 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:00:54,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:00:54,828 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:00:54,829 INFO L268 AbstractInterpreter]: Visited 34 different actions 87 times. Merged at 22 different actions 48 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 31 variables. [2018-01-21 01:00:54,860 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:00:54,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:54,861 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:00:54,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:54,875 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:00:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:54,913 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:00:54,949 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:00:54,971 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc3.base| Int) (|main_#t~malloc0.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc3.base| 1)))) is different from true [2018-01-21 01:00:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2018-01-21 01:00:55,021 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:00:55,055 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_8| Int)) (not (= (store |c_#valid| |v_main_#t~malloc3.base_8| 1) |c_old(#valid)|))) is different from false [2018-01-21 01:00:55,069 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_8| Int) (|v_main_#t~malloc0.base_6| Int)) (or (not (= (store (store |c_#valid| |v_main_#t~malloc0.base_6| 1) |v_main_#t~malloc3.base_8| 1) |c_old(#valid)|)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_6|))))) is different from false [2018-01-21 01:00:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2018-01-21 01:00:55,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:55,113 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:00:55,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:55,126 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:00:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:55,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:00:55,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 01:00:55,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:00:55,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:55,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:55,394 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:00:55,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-21 01:00:55,421 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:00:55,425 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:00:55,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:55,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:55,438 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:00:55,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:18 [2018-01-21 01:00:55,441 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 (= (select .cse0 |c_main_#t~mem5.base|) 0) (= |c_#valid| (store .cse0 |c_main_#t~mem5.base| 1))))) is different from true [2018-01-21 01:00:55,448 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:00:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2018-01-21 01:00:55,496 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:00:55,563 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_12| Int)) (or (not (= (store |c_#valid| |v_main_#t~malloc3.base_12| 1) |c_old(#valid)|)) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_12|))))) is different from false [2018-01-21 01:00:55,580 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_10| Int) (|v_main_#t~malloc3.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_10| 1))) (or (not (= (store .cse0 |v_main_#t~malloc3.base_12| 1) |c_old(#valid)|)) (not (= (select .cse0 |v_main_#t~malloc3.base_12|) 0))))) is different from false [2018-01-21 01:00:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2018-01-21 01:00:55,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:00:55,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 12, 5] total 22 [2018-01-21 01:00:55,613 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:00:55,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 01:00:55,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 01:00:55,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=159, Unknown=8, NotChecked=248, Total=462 [2018-01-21 01:00:55,615 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 8 states. [2018-01-21 01:00:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:00:55,734 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-01-21 01:00:55,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 01:00:55,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-21 01:00:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:00:55,736 INFO L225 Difference]: With dead ends: 66 [2018-01-21 01:00:55,736 INFO L226 Difference]: Without dead ends: 50 [2018-01-21 01:00:55,738 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=204, Unknown=12, NotChecked=280, Total=552 [2018-01-21 01:00:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-21 01:00:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-01-21 01:00:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-21 01:00:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-01-21 01:00:55,744 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 37 [2018-01-21 01:00:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:00:55,745 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-01-21 01:00:55,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 01:00:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-01-21 01:00:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 01:00:55,746 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:55,747 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:00:55,747 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:55,747 INFO L82 PathProgramCache]: Analyzing trace with hash -484218618, now seen corresponding path program 2 times [2018-01-21 01:00:55,747 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:55,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:55,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:55,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:55,748 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:55,783 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:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 01:00:56,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:56,041 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:00:56,041 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 01:00:56,041 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:00:56,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:56,041 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:00:56,051 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 01:00:56,052 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 01:00:56,072 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:00:56,084 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:00:56,096 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 01:00:56,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:00:56,115 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:00:56,140 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc3.base| Int) (|main_#t~malloc0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (and (= (select .cse0 |main_#t~malloc3.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= |c_#valid| (store .cse0 |main_#t~malloc3.base| 1))))) is different from true [2018-01-21 01:00:56,157 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc3.base| Int) (|main_#t~malloc0.base| Int) (v_prenex_1 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~malloc3.base| 1)) (= (select .cse1 v_prenex_1) 0) (= 0 (select .cse0 |main_#t~malloc3.base|)) (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0))))) is different from true [2018-01-21 01:00:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 16 not checked. [2018-01-21 01:00:56,198 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:00:56,236 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_18|))) (not (= (store |c_#valid| |v_main_#t~malloc3.base_18| 1) |c_old(#valid)|)))) is different from false [2018-01-21 01:00:56,247 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_19| Int) (|v_main_#t~malloc3.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc3.base_19| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_19|))) (not (= 0 (select .cse0 |v_main_#t~malloc3.base_18|))) (not (= (store .cse0 |v_main_#t~malloc3.base_18| 1) |c_old(#valid)|))))) is different from false [2018-01-21 01:00:56,270 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_19| Int) (|v_main_#t~malloc3.base_18| Int) (|v_main_#t~malloc0.base_14| Int)) (let ((.cse1 (store |c_#valid| |v_main_#t~malloc0.base_14| 1))) (let ((.cse0 (store .cse1 |v_main_#t~malloc3.base_19| 1))) (or (not (= |c_old(#valid)| (store .cse0 |v_main_#t~malloc3.base_18| 1))) (not (= 0 (select .cse1 |v_main_#t~malloc3.base_19|))) (not (= (select .cse0 |v_main_#t~malloc3.base_18|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc0.base_14|) 0)))))) is different from false [2018-01-21 01:00:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 16 not checked. [2018-01-21 01:00:56,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:56,321 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:00:56,325 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 01:00:56,326 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 01:00:56,343 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:00:56,362 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:00:56,381 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 01:00:56,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:00:56,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-21 01:00:56,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-21 01:00:56,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:58 [2018-01-21 01:00:56,567 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 5502 column 44: unknown constant v_DerPreprocessor_1 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1362) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:582) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:146) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:95) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:105) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:297) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:239) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:198) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.assertTerm(ManagedScript.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:998) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:942) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:355) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:573) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-21 01:00:56,569 INFO L168 Benchmark]: Toolchain (without parser) took 3768.66 ms. Allocated memory was 300.4 MB in the beginning and 511.7 MB in the end (delta: 211.3 MB). Free memory was 257.6 MB in the beginning and 380.5 MB in the end (delta: -123.0 MB). Peak memory consumption was 88.3 MB. Max. memory is 5.3 GB. [2018-01-21 01:00:56,570 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 300.4 MB. Free memory is still 263.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:00:56,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.22 ms. Allocated memory is still 300.4 MB. Free memory was 257.6 MB in the beginning and 247.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:00:56,570 INFO L168 Benchmark]: Boogie Preprocessor took 29.39 ms. Allocated memory is still 300.4 MB. Free memory was 247.6 MB in the beginning and 245.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:00:56,570 INFO L168 Benchmark]: RCFGBuilder took 247.30 ms. Allocated memory is still 300.4 MB. Free memory was 245.6 MB in the beginning and 228.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:00:56,571 INFO L168 Benchmark]: TraceAbstraction took 3285.99 ms. Allocated memory was 300.4 MB in the beginning and 511.7 MB in the end (delta: 211.3 MB). Free memory was 226.7 MB in the beginning and 380.5 MB in the end (delta: -153.9 MB). Peak memory consumption was 57.4 MB. Max. memory is 5.3 GB. [2018-01-21 01:00:56,572 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.21 ms. Allocated memory is still 300.4 MB. Free memory is still 263.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.22 ms. Allocated memory is still 300.4 MB. Free memory was 257.6 MB in the beginning and 247.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.39 ms. Allocated memory is still 300.4 MB. Free memory was 247.6 MB in the beginning and 245.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 247.30 ms. Allocated memory is still 300.4 MB. Free memory was 245.6 MB in the beginning and 228.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3285.99 ms. Allocated memory was 300.4 MB in the beginning and 511.7 MB in the end (delta: 211.3 MB). Free memory was 226.7 MB in the beginning and 380.5 MB in the end (delta: -153.9 MB). Peak memory consumption was 57.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 32 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 281 LocStat_NO_SUPPORTING_DISEQUALITIES : 91 LocStat_NO_DISJUNCTIONS : -64 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 38 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 58 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.686393 RENAME_VARIABLES(MILLISECONDS) : 0.670788 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.627868 PROJECTAWAY(MILLISECONDS) : 0.566128 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001522 DISJOIN(MILLISECONDS) : 1.119189 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.716651 ADD_EQUALITY(MILLISECONDS) : 0.059474 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.045207 #CONJOIN_DISJUNCTIVE : 150 #RENAME_VARIABLES : 279 #UNFREEZE : 0 #CONJOIN : 204 #PROJECTAWAY : 177 #ADD_WEAK_EQUALITY : 29 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 268 #ADD_EQUALITY : 76 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 * 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, 44 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=41occurred 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, 9 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 9 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 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, 44 locations, 4 error locations. UNSAFE Result, 0.0s 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=41occurred 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 - ExceptionOrErrorResult: SMTLIBException: line 5502 column 44: unknown constant v_DerPreprocessor_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 5502 column 44: unknown constant v_DerPreprocessor_1: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1362) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-00-56-579.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_01-00-56-579.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_01-00-56-579.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-00-56-579.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_01-00-56-579.csv Received shutdown request...