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/memsafety/test-0513_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:37:18,527 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:37:18,529 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:37:18,544 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:37:18,544 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:37:18,545 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:37:18,546 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:37:18,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:37:18,550 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:37:18,551 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:37:18,552 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:37:18,552 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:37:18,553 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:37:18,555 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:37:18,555 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:37:18,558 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:37:18,560 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:37:18,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:37:18,564 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:37:18,565 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:37:18,568 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:37:18,568 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:37:18,569 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:37:18,570 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:37:18,570 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:37:18,572 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:37:18,572 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:37:18,573 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:37:18,573 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:37:18,573 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:37:18,574 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:37:18,574 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 00:37:18,583 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:37:18,583 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:37:18,584 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:37:18,584 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:37:18,584 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:37:18,584 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:37:18,584 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:37:18,585 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:37:18,585 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:37:18,585 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:37:18,585 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:37:18,585 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:37:18,586 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:37:18,586 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:37:18,586 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:37:18,586 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:37:18,586 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:37:18,586 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:37:18,586 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:37:18,586 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:37:18,587 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:37:18,587 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:37:18,587 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:37:18,587 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:37:18,587 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:37:18,588 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:37:18,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:37:18,588 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:37:18,588 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:37:18,588 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:37:18,588 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:37:18,589 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:37:18,589 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:37:18,589 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:37:18,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:37:18,589 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:37:18,589 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:37:18,590 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:37:18,590 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:37:18,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:37:18,633 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:37:18,636 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:37:18,637 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:37:18,637 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:37:18,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0513_true-valid-memsafety.i [2018-01-21 00:37:18,797 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:37:18,801 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:37:18,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:37:18,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:37:18,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:37:18,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:37:18" (1/1) ... [2018-01-21 00:37:18,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4366fcc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:37:18, skipping insertion in model container [2018-01-21 00:37:18,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:37:18" (1/1) ... [2018-01-21 00:37:18,827 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:37:18,865 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:37:18,990 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:37:19,018 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:37:19,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:37:19 WrapperNode [2018-01-21 00:37:19,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:37:19,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:37:19,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:37:19,029 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:37:19,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:37:19" (1/1) ... [2018-01-21 00:37:19,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:37:19" (1/1) ... [2018-01-21 00:37:19,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:37:19" (1/1) ... [2018-01-21 00:37:19,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:37:19" (1/1) ... [2018-01-21 00:37:19,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:37:19" (1/1) ... [2018-01-21 00:37:19,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:37:19" (1/1) ... [2018-01-21 00:37:19,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:37:19" (1/1) ... [2018-01-21 00:37:19,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:37:19,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:37:19,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:37:19,069 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:37:19,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:37:19" (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 00:37:19,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:37:19,118 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:37:19,118 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:37:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:37:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:37:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:37:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:37:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:37:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:37:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:37:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:37:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:37:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-21 00:37:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:37:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:37:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:37:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:37:19,501 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:37:19,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:37:19 BoogieIcfgContainer [2018-01-21 00:37:19,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:37:19,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:37:19,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:37:19,506 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:37:19,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:37:18" (1/3) ... [2018-01-21 00:37:19,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234b90e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:37:19, skipping insertion in model container [2018-01-21 00:37:19,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:37:19" (2/3) ... [2018-01-21 00:37:19,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234b90e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:37:19, skipping insertion in model container [2018-01-21 00:37:19,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:37:19" (3/3) ... [2018-01-21 00:37:19,511 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0513_true-valid-memsafety.i [2018-01-21 00:37:19,521 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:37:19,531 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 00:37:19,585 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:37:19,585 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:37:19,585 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:37:19,585 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:37:19,586 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:37:19,586 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:37:19,586 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:37:19,586 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:37:19,587 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:37:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-01-21 00:37:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:37:19,617 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:37:19,618 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:37:19,618 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:37:19,622 INFO L82 PathProgramCache]: Analyzing trace with hash 177526, now seen corresponding path program 1 times [2018-01-21 00:37:19,623 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:37:19,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:19,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:37:19,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:19,664 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:37:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:37:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:37:19,719 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:37:19,725 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:37:19,732 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:37:19,732 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:37:19,732 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:37:19,733 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:37:19,733 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:37:19,733 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:37:19,733 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:37:19,733 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:37:19,733 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:37:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-01-21 00:37:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 00:37:19,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:37:19,739 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:37:19,739 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:37:19,740 INFO L82 PathProgramCache]: Analyzing trace with hash 400164698, now seen corresponding path program 1 times [2018-01-21 00:37:19,740 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:37:19,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:19,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:37:19,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:19,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:37:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:37:19,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:37:19,780 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 00:37:19,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:37:19,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:37:19,783 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:37:19,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:37:19,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:37:19,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:37:19,874 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 2 states. [2018-01-21 00:37:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:37:19,900 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2018-01-21 00:37:19,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:37:19,901 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-21 00:37:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:37:19,912 INFO L225 Difference]: With dead ends: 155 [2018-01-21 00:37:19,912 INFO L226 Difference]: Without dead ends: 78 [2018-01-21 00:37:19,915 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 00:37:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-21 00:37:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-21 00:37:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-21 00:37:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-01-21 00:37:19,954 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 11 [2018-01-21 00:37:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:37:19,954 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-01-21 00:37:19,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:37:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-01-21 00:37:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 00:37:19,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:37:19,955 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:37:19,955 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:37:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1707388296, now seen corresponding path program 1 times [2018-01-21 00:37:19,956 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:37:19,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:19,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:37:19,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:19,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:37:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:37:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:37:19,984 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:37:19,987 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:37:19,989 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:37:19,989 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:37:19,998 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:37:19,998 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:37:19,998 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:37:19,999 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:37:19,999 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:37:19,999 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:37:19,999 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:37:19,999 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:37:19,999 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:37:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-01-21 00:37:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-21 00:37:20,002 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:37:20,002 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:37:20,002 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:37:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1944548319, now seen corresponding path program 1 times [2018-01-21 00:37:20,003 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:37:20,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:20,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:37:20,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:20,004 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:37:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:37:20,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:37:20,022 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 00:37:20,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:37:20,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:37:20,023 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:37:20,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:37:20,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:37:20,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:37:20,024 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 2 states. [2018-01-21 00:37:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:37:20,034 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2018-01-21 00:37:20,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:37:20,034 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-21 00:37:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:37:20,036 INFO L225 Difference]: With dead ends: 155 [2018-01-21 00:37:20,036 INFO L226 Difference]: Without dead ends: 76 [2018-01-21 00:37:20,037 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 00:37:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-21 00:37:20,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-21 00:37:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-21 00:37:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-01-21 00:37:20,046 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 9 [2018-01-21 00:37:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:37:20,046 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-01-21 00:37:20,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:37:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-01-21 00:37:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 00:37:20,047 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:37:20,047 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:37:20,047 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:37:20,047 INFO L82 PathProgramCache]: Analyzing trace with hash 364703357, now seen corresponding path program 1 times [2018-01-21 00:37:20,048 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:37:20,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:20,049 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:37:20,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:20,049 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:37:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:37:20,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:37:20,091 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 00:37:20,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:37:20,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:37:20,091 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:37:20,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:37:20,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:37:20,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:37:20,093 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 3 states. [2018-01-21 00:37:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:37:20,142 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-01-21 00:37:20,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:37:20,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 00:37:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:37:20,144 INFO L225 Difference]: With dead ends: 100 [2018-01-21 00:37:20,144 INFO L226 Difference]: Without dead ends: 98 [2018-01-21 00:37:20,145 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 00:37:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-21 00:37:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2018-01-21 00:37:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-21 00:37:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-01-21 00:37:20,151 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 11 [2018-01-21 00:37:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:37:20,151 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-01-21 00:37:20,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:37:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-01-21 00:37:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:37:20,152 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:37:20,152 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] [2018-01-21 00:37:20,152 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:37:20,152 INFO L82 PathProgramCache]: Analyzing trace with hash -63678405, now seen corresponding path program 1 times [2018-01-21 00:37:20,152 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:37:20,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:20,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:37:20,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:20,153 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:37:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:37:20,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:37:20,191 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 00:37:20,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:37:20,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:37:20,192 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:37:20,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:37:20,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:37:20,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:37:20,193 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 3 states. [2018-01-21 00:37:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:37:20,227 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2018-01-21 00:37:20,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:37:20,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-21 00:37:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:37:20,228 INFO L225 Difference]: With dead ends: 162 [2018-01-21 00:37:20,228 INFO L226 Difference]: Without dead ends: 91 [2018-01-21 00:37:20,229 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 00:37:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-21 00:37:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-01-21 00:37:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-21 00:37:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-01-21 00:37:20,235 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 20 [2018-01-21 00:37:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:37:20,235 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-01-21 00:37:20,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:37:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-01-21 00:37:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 00:37:20,236 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:37:20,236 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] [2018-01-21 00:37:20,236 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:37:20,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1819825368, now seen corresponding path program 1 times [2018-01-21 00:37:20,236 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:37:20,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:20,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:37:20,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:20,237 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:37:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:37:20,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:37:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:37:20,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:37:20,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:37:20,323 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:37:20,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:37:20,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:37:20,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:37:20,325 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 5 states. [2018-01-21 00:37:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:37:20,475 INFO L93 Difference]: Finished difference Result 207 states and 228 transitions. [2018-01-21 00:37:20,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 00:37:20,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-21 00:37:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:37:20,477 INFO L225 Difference]: With dead ends: 207 [2018-01-21 00:37:20,478 INFO L226 Difference]: Without dead ends: 137 [2018-01-21 00:37:20,478 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:37:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-21 00:37:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 89. [2018-01-21 00:37:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-21 00:37:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-01-21 00:37:20,486 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 28 [2018-01-21 00:37:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:37:20,486 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-01-21 00:37:20,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:37:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-01-21 00:37:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:37:20,488 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:37:20,488 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, 1, 1, 1, 1, 1, 1] [2018-01-21 00:37:20,488 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 00:37:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash 554100800, now seen corresponding path program 1 times [2018-01-21 00:37:20,489 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:37:20,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:20,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:37:20,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:20,490 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:37:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:37:20,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:37:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:37:20,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:37:20,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-21 00:37:20,813 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:37:20,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-21 00:37:20,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-21 00:37:20,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-21 00:37:20,814 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 10 states. [2018-01-21 00:37:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:37:21,221 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-01-21 00:37:21,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-21 00:37:21,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-21 00:37:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:37:21,223 INFO L225 Difference]: With dead ends: 146 [2018-01-21 00:37:21,223 INFO L226 Difference]: Without dead ends: 143 [2018-01-21 00:37:21,224 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-01-21 00:37:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-21 00:37:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 103. [2018-01-21 00:37:21,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-21 00:37:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-21 00:37:21,236 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 37 [2018-01-21 00:37:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:37:21,236 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-21 00:37:21,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-21 00:37:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-21 00:37:21,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 00:37:21,238 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:37:21,238 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, 1, 1, 1, 1, 1] [2018-01-21 00:37:21,239 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 00:37:21,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1918168780, now seen corresponding path program 1 times [2018-01-21 00:37:21,240 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:37:21,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:21,241 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:37:21,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:21,241 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:37:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:37:21,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:37:21,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:37:21,792 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:37:21,792 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:37:21,793 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-01-21 00:37:21,795 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [12], [13], [18], [20], [21], [22], [23], [24], [25], [34], [35], [36], [38], [39], [46], [50], [52], [55], [120], [121], [122], [126], [130], [132], [133], [134], [135], [139], [141], [142], [143], [149], [150], [151] [2018-01-21 00:37:21,842 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:37:21,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:37:22,297 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:37:22,299 INFO L268 AbstractInterpreter]: Visited 39 different actions 70 times. Merged at 22 different actions 30 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 35 variables. [2018-01-21 00:37:22,312 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:37:22,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:37:22,312 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 00:37:22,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:37:22,325 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:37:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:37:22,361 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:37:22,563 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 00:37:22,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 8 treesize of output 7 [2018-01-21 00:37:22,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:22,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:22,573 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 00:37:22,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:35 [2018-01-21 00:37:22,660 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 48 treesize of output 40 [2018-01-21 00:37:22,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2018-01-21 00:37:22,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:37:22,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-21 00:37:22,687 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 48 treesize of output 40 [2018-01-21 00:37:22,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:37:22,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-21 00:37:22,695 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 00:37:22,704 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 00:37:22,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-21 00:37:22,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:97, output treesize:88 [2018-01-21 00:37:23,149 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~data~5.base Int) (main_~item2~5.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~item2~5.base 1))) (and (= |c_#valid| (store (store .cse0 main_~data~5.base 0) main_~item2~5.base 0)) (not (= main_~data~5.base 0)) (= 0 (select |c_old(#valid)| main_~item2~5.base)) (not (= 0 main_~item2~5.base)) (= 0 (select .cse0 main_~data~5.base))))) is different from true [2018-01-21 00:37:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-21 00:37:23,168 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:37:23,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-01-21 00:37:23,244 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 14 [2018-01-21 00:37:23,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:23,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:23,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:37:23,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-01-21 00:37:23,438 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 21 treesize of output 17 [2018-01-21 00:37:23,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-21 00:37:23,440 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 00:37:23,445 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 00:37:23,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-21 00:37:23,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:91 [2018-01-21 00:37:23,464 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse2 (= 0 c_main_~lItem~5.offset)) (.cse1 (= c_main_~data~5.base c_main_~lItem~5.base)) (.cse3 (= (store (store |c_#valid| c_main_~data~5.base 0) c_main_~item~5.base 0) |c_old(#valid)|)) (.cse0 (= c_main_~data~5.base 0)) (.cse4 (= c_main_~item~5.base 0))) (and (or .cse0 (forall ((v_arrayElimCell_8 Int)) (or (= 0 v_arrayElimCell_8) (= (store (store |c_#valid| c_main_~data~5.base 0) v_arrayElimCell_8 0) |c_old(#valid)|))) .cse1) (or (forall ((v_prenex_3 Int)) (or (= (store (store |c_#valid| c_main_~data~5.base 0) v_prenex_3 0) |c_old(#valid)|) (= 0 v_prenex_3))) .cse2 .cse0) (or .cse3 (not .cse2) .cse0 .cse4 (not .cse1)) (or .cse3 (forall ((v_prenex_4 Int)) (or (= 0 v_prenex_4) (= |c_old(#valid)| (store (store |c_#valid| c_main_~data~5.base 0) v_prenex_4 0)))) .cse0 .cse4))) is different from false [2018-01-21 00:37:23,597 WARN L1007 $PredicateComparison]: unable to prove that (or (= c_main_~item~5.base 0) (forall ((|v_main_#t~malloc5.base_4| Int)) (or (= |c_old(#valid)| (store (store |c_#valid| |v_main_#t~malloc5.base_4| 0) c_main_~item~5.base 0)) (not (= (select |c_#valid| |v_main_#t~malloc5.base_4|) 0)) (= 0 |v_main_#t~malloc5.base_4|)))) is different from false [2018-01-21 00:37:23,606 WARN L1007 $PredicateComparison]: unable to prove that (or (= |c_main_#t~malloc1.base| 0) (forall ((|v_main_#t~malloc5.base_4| Int)) (or (= (store (store |c_#valid| |v_main_#t~malloc5.base_4| 0) |c_main_#t~malloc1.base| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc5.base_4|) 0)) (= 0 |v_main_#t~malloc5.base_4|)))) is different from false [2018-01-21 00:37:23,610 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc1.base_4| Int) (|v_main_#t~malloc5.base_4| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc1.base_4| 1))) (or (= 0 |v_main_#t~malloc1.base_4|) (= |c_old(#valid)| (store (store .cse0 |v_main_#t~malloc5.base_4| 0) |v_main_#t~malloc1.base_4| 0)) (not (= 0 (select .cse0 |v_main_#t~malloc5.base_4|))) (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_4|))) (= 0 |v_main_#t~malloc5.base_4|)))) is different from false [2018-01-21 00:37:23,618 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc1.base_4| Int) (|v_main_#t~malloc5.base_4| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc1.base_4| 1))) (or (= 0 |v_main_#t~malloc1.base_4|) (not (= 0 (select .cse0 |v_main_#t~malloc5.base_4|))) (= |c_#valid| (store (store .cse0 |v_main_#t~malloc5.base_4| 0) |v_main_#t~malloc1.base_4| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_4|))) (= 0 |v_main_#t~malloc5.base_4|)))) is different from false [2018-01-21 00:37:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 00:37:23,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:37:23,653 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 00:37:23,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:37:23,657 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:37:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:37:24,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:37:24,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 00:37:24,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:37:24,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:24,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:24,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:24,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-01-21 00:37:24,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 00:37:24,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:37:24,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:37:24,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-01-21 00:37:24,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:24,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:24,447 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 00:37:24,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:60 [2018-01-21 00:37:24,519 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 49 treesize of output 39 [2018-01-21 00:37:24,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:37:24,539 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 39 treesize of output 27 [2018-01-21 00:37:24,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:24,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:24,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:24,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:32 [2018-01-21 00:37:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:37:25,063 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:37:25,200 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:37:25,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-01-21 00:37:25,211 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 14 [2018-01-21 00:37:25,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:25,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:25,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:37:25,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:39 [2018-01-21 00:37:25,797 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_5| Int) (|v_main_#t~malloc1.base_5| Int)) (let ((.cse1 (store |c_#valid| |v_main_#t~malloc1.base_5| 1))) (let ((.cse0 (store .cse1 |v_main_#t~malloc5.base_5| 0))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_5|))) (= 0 |v_main_#t~malloc1.base_5|) (= (store .cse0 |v_main_#t~malloc1.base_5| 0) |c_old(#valid)|) (= 0 |v_main_#t~malloc5.base_5|) (not (= 1 (select .cse0 |v_main_#t~malloc1.base_5|))) (not (= (select .cse1 |v_main_#t~malloc5.base_5|) 0)))))) is different from false [2018-01-21 00:37:25,806 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc5.base_5| Int) (|v_main_#t~malloc1.base_5| Int)) (let ((.cse1 (store |c_#valid| |v_main_#t~malloc1.base_5| 1))) (let ((.cse0 (store .cse1 |v_main_#t~malloc5.base_5| 0))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_5|))) (= 0 |v_main_#t~malloc1.base_5|) (= 0 |v_main_#t~malloc5.base_5|) (= (store .cse0 |v_main_#t~malloc1.base_5| 0) |c_#valid|) (not (= 1 (select .cse0 |v_main_#t~malloc1.base_5|))) (not (= (select .cse1 |v_main_#t~malloc5.base_5|) 0)))))) is different from false [2018-01-21 00:37:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 00:37:25,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 00:37:25,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14, 16, 13] total 62 [2018-01-21 00:37:25,838 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 00:37:25,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-21 00:37:25,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-21 00:37:25,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2947, Unknown=31, NotChecked=690, Total=3906 [2018-01-21 00:37:25,841 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 25 states. [2018-01-21 00:37:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:37:27,321 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-01-21 00:37:27,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-21 00:37:27,322 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2018-01-21 00:37:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:37:27,323 INFO L225 Difference]: With dead ends: 126 [2018-01-21 00:37:27,323 INFO L226 Difference]: Without dead ends: 123 [2018-01-21 00:37:27,328 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 114 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=416, Invalid=4543, Unknown=35, NotChecked=858, Total=5852 [2018-01-21 00:37:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-21 00:37:27,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2018-01-21 00:37:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-21 00:37:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-01-21 00:37:27,342 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 42 [2018-01-21 00:37:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:37:27,343 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-01-21 00:37:27,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-21 00:37:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-01-21 00:37:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 00:37:27,344 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:37:27,344 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:37:27,344 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 00:37:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash -306110528, now seen corresponding path program 2 times [2018-01-21 00:37:27,345 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:37:27,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:27,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:37:27,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:37:27,346 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:37:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:37:27,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:37:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:37:27,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:37:27,949 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:37:27,949 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 00:37:27,949 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 00:37:27,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:37:27,949 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 00:37:27,960 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 00:37:27,960 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 00:37:27,979 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:37:27,991 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 00:37:27,995 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 00:37:27,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:37:28,021 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 00:37:28,023 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 00:37:28,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-21 00:37:28,040 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 23 treesize of output 18 [2018-01-21 00:37:28,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-01-21 00:37:28,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:7 [2018-01-21 00:37:28,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-01-21 00:37:28,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-21 00:37:28,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-01-21 00:37:28,141 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:37:28,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:37:28,162 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:33 [2018-01-21 00:37:28,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-01-21 00:37:28,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-21 00:37:28,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,251 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 19 treesize of output 14 [2018-01-21 00:37:28,253 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 14 treesize of output 15 [2018-01-21 00:37:28,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:37:28,264 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:35 [2018-01-21 00:37:28,339 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 41 treesize of output 39 [2018-01-21 00:37:28,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-21 00:37:28,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,350 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 37 treesize of output 35 [2018-01-21 00:37:28,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-21 00:37:28,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,369 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 37 treesize of output 35 [2018-01-21 00:37:28,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-21 00:37:28,371 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,377 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,379 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 00:37:28,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-21 00:37:28,381 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,386 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:37:28,406 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:157, output treesize:93 [2018-01-21 00:37:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-01-21 00:37:28,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-01-21 00:37:28,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,521 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 00:37:28,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:67 [2018-01-21 00:37:28,646 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:37:28,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:37:28,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-01-21 00:37:28,668 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 31 [2018-01-21 00:37:28,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-01-21 00:37:28,702 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:37:28,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-21 00:37:28,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:37:28,777 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:37:28,778 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-01-21 00:37:28,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2018-01-21 00:37:28,789 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-21 00:37:28,799 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:37:28,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:37:28,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:37:28,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-01-21 00:37:28,848 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2018-01-21 00:37:28,849 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-21 00:37:28,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:37:28,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-21 00:37:28,863 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,867 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:28,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-01-21 00:37:28,896 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:131, output treesize:93 [2018-01-21 00:37:29,014 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 00:37:29,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:29,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:29,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-01-21 00:37:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:37:29,039 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:37:29,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-21 00:37:29,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:29,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:29,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:22 [2018-01-21 00:37:29,237 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 10 treesize of output 8 [2018-01-21 00:37:29,239 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 8 treesize of output 1 [2018-01-21 00:37:29,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:37:29,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:29,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:37:29,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:36 [2018-01-21 00:38:02,170 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 00:38:02,172 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 00:38:02,176 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 1 xjuncts. [2018-01-21 00:38:02,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:16 [2018-01-21 00:38:02,214 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 15 treesize of output 13 [2018-01-21 00:38:02,216 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 13 treesize of output 17 [2018-01-21 00:38:02,224 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 13 treesize of output 6 [2018-01-21 00:38:02,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:02,225 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-01-21 00:38:02,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:38:02,232 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:02,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:02,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-21 00:38:02,287 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:13 [2018-01-21 00:38:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:38:02,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-21 00:38:02,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [18, 20] total 45 [2018-01-21 00:38:02,322 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:38:02,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-21 00:38:02,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-21 00:38:02,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1763, Unknown=10, NotChecked=0, Total=1980 [2018-01-21 00:38:02,323 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 20 states. [2018-01-21 00:38:17,117 WARN L143 SmtUtils]: Spent 9221ms on a formula simplification that was a NOOP. DAG size: 34 Received shutdown request... [2018-01-21 00:38:30,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 00:38:30,497 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 00:38:30,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:38:30 BoogieIcfgContainer [2018-01-21 00:38:30,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:38:30,499 INFO L168 Benchmark]: Toolchain (without parser) took 71702.14 ms. Allocated memory was 305.7 MB in the beginning and 603.5 MB in the end (delta: 297.8 MB). Free memory was 264.0 MB in the beginning and 509.4 MB in the end (delta: -245.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:30,500 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 305.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:38:30,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.16 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 252.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:30,500 INFO L168 Benchmark]: Boogie Preprocessor took 39.54 ms. Allocated memory is still 305.7 MB. Free memory was 252.0 MB in the beginning and 249.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:30,500 INFO L168 Benchmark]: RCFGBuilder took 433.73 ms. Allocated memory is still 305.7 MB. Free memory was 249.9 MB in the beginning and 224.3 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:30,501 INFO L168 Benchmark]: TraceAbstraction took 70995.57 ms. Allocated memory was 305.7 MB in the beginning and 603.5 MB in the end (delta: 297.8 MB). Free memory was 224.3 MB in the beginning and 509.4 MB in the end (delta: -285.1 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. [2018-01-21 00:38:30,502 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.13 ms. Allocated memory is still 305.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 226.16 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 252.0 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.54 ms. Allocated memory is still 305.7 MB. Free memory was 252.0 MB in the beginning and 249.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 433.73 ms. Allocated memory is still 305.7 MB. Free memory was 249.9 MB in the beginning and 224.3 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 70995.57 ms. Allocated memory was 305.7 MB in the beginning and 603.5 MB in the end (delta: 297.8 MB). Free memory was 224.3 MB in the beginning and 509.4 MB in the end (delta: -285.1 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 37 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 405 LocStat_NO_SUPPORTING_DISEQUALITIES : 143 LocStat_NO_DISJUNCTIONS : -74 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 43 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 97 TransStat_NO_SUPPORTING_DISEQUALITIES : 20 TransStat_NO_DISJUNCTIONS : 52 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.044913 RENAME_VARIABLES(MILLISECONDS) : 0.510731 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.486634 PROJECTAWAY(MILLISECONDS) : 0.292508 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001818 DISJOIN(MILLISECONDS) : 0.996638 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.557471 ADD_EQUALITY(MILLISECONDS) : 0.019713 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.021963 #CONJOIN_DISJUNCTIVE : 127 #RENAME_VARIABLES : 231 #UNFREEZE : 0 #CONJOIN : 245 #PROJECTAWAY : 162 #ADD_WEAK_EQUALITY : 31 #DISJOIN : 23 #RENAME_VARIABLES_DISJUNCTIVE : 203 #ADD_EQUALITY : 96 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 12 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 3 procedures, 81 locations, 3 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=81occurred 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L629] struct TLItem* data = ((void *)0); [L630] struct DItem* item, * item2; [L631] struct TLItem *lItem; VAL [data={0:0}] [L632] COND FALSE !(__VERIFIER_nondet_int()) [L650] COND TRUE !data [L651] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 81 locations, 3 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 89 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (108states) and interpolant automaton (currently 8 states, 20 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 47. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 81 locations, 3 error locations. TIMEOUT Result, 70.4s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 30.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 455 SDtfs, 572 SDslu, 1256 SDs, 0 SdLazy, 1164 SolverSat, 52 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 188 SyntacticMatches, 18 SemanticMatches, 149 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2249 ImplicationChecksByTransitivity, 52.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 123 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 38.9s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 443 ConstructedInterpolants, 61 QuantifiedInterpolants, 360919 SizeOfPredicates, 57 NumberOfNonLiveVariables, 463 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 35/67 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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/test-0513_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-38-30-512.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_00-38-30-512.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_00-38-30-512.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-38-30-512.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-38-30-512.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-38-30-512.csv Completed graceful shutdown