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_mostprecise.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 03:11:51,582 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 03:11:51,584 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 03:11:51,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 03:11:51,610 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 03:11:51,611 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 03:11:51,616 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 03:11:51,625 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 03:11:51,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 03:11:51,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 03:11:51,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 03:11:51,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 03:11:51,629 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 03:11:51,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 03:11:51,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 03:11:51,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 03:11:51,636 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 03:11:51,638 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 03:11:51,640 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 03:11:51,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 03:11:51,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 03:11:51,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 03:11:51,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 03:11:51,645 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 03:11:51,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 03:11:51,647 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 03:11:51,648 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 03:11:51,649 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 03:11:51,649 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 03:11:51,649 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 03:11:51,650 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 03:11:51,650 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_mostprecise.epf [2018-01-21 03:11:51,660 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 03:11:51,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 03:11:51,661 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 03:11:51,662 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 03:11:51,662 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 03:11:51,662 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 03:11:51,662 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 03:11:51,662 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 03:11:51,663 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 03:11:51,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 03:11:51,663 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 03:11:51,664 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 03:11:51,664 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 03:11:51,664 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 03:11:51,664 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 03:11:51,664 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 03:11:51,665 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 03:11:51,665 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 03:11:51,665 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 03:11:51,665 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 03:11:51,665 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 03:11:51,666 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 03:11:51,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 03:11:51,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 03:11:51,666 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 03:11:51,667 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 03:11:51,667 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 03:11:51,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 03:11:51,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 03:11:51,667 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 03:11:51,668 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 03:11:51,668 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 03:11:51,668 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 03:11:51,668 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 03:11:51,668 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 03:11:51,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 03:11:51,669 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 03:11:51,669 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 03:11:51,670 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 03:11:51,670 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 03:11:51,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 03:11:51,716 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 03:11:51,719 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 03:11:51,720 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 03:11:51,721 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 03:11:51,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-21 03:11:51,919 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 03:11:51,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 03:11:51,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 03:11:51,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 03:11:51,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 03:11:51,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:11:51" (1/1) ... [2018-01-21 03:11:51,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157b506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:51, skipping insertion in model container [2018-01-21 03:11:51,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:11:51" (1/1) ... [2018-01-21 03:11:51,967 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:11:52,027 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:11:52,146 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:11:52,164 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:11:52,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:52 WrapperNode [2018-01-21 03:11:52,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 03:11:52,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 03:11:52,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 03:11:52,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 03:11:52,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:52" (1/1) ... [2018-01-21 03:11:52,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:52" (1/1) ... [2018-01-21 03:11:52,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:52" (1/1) ... [2018-01-21 03:11:52,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:52" (1/1) ... [2018-01-21 03:11:52,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:52" (1/1) ... [2018-01-21 03:11:52,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:52" (1/1) ... [2018-01-21 03:11:52,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:52" (1/1) ... [2018-01-21 03:11:52,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 03:11:52,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 03:11:52,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 03:11:52,203 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 03:11:52,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:52" (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 03:11:52,255 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 03:11:52,255 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 03:11:52,255 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-21 03:11:52,255 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 03:11:52,256 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 03:11:52,256 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 03:11:52,256 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 03:11:52,256 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 03:11:52,256 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 03:11:52,256 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 03:11:52,256 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 03:11:52,256 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 03:11:52,256 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-21 03:11:52,257 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 03:11:52,257 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 03:11:52,257 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 03:11:52,460 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 03:11:52,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:11:52 BoogieIcfgContainer [2018-01-21 03:11:52,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 03:11:52,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 03:11:52,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 03:11:52,464 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 03:11:52,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 03:11:51" (1/3) ... [2018-01-21 03:11:52,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5311ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:11:52, skipping insertion in model container [2018-01-21 03:11:52,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:52" (2/3) ... [2018-01-21 03:11:52,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5311ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:11:52, skipping insertion in model container [2018-01-21 03:11:52,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:11:52" (3/3) ... [2018-01-21 03:11:52,468 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-01-21 03:11:52,475 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 03:11:52,482 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 03:11:52,523 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:11:52,523 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:11:52,523 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:11:52,523 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:11:52,524 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:11:52,524 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:11:52,524 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:11:52,524 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 03:11:52,525 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:11:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-21 03:11:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 03:11:52,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:52,551 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 03:11:52,551 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 03:11:52,555 INFO L82 PathProgramCache]: Analyzing trace with hash 104751, now seen corresponding path program 1 times [2018-01-21 03:11:52,558 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:52,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:52,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:52,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:52,633 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:11:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:11:52,738 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:11:52,748 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:11:52,761 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:11:52,762 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:11:52,762 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:11:52,762 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:11:52,762 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:11:52,762 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:11:52,762 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:11:52,762 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == fooErr0EnsuresViolation======== [2018-01-21 03:11:52,762 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:11:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-21 03:11:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 03:11:52,766 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:52,766 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:11:52,766 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr0EnsuresViolation]=== [2018-01-21 03:11:52,767 INFO L82 PathProgramCache]: Analyzing trace with hash -387558155, now seen corresponding path program 1 times [2018-01-21 03:11:52,767 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:52,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:52,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:52,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:52,769 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:11:52,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:11:52,842 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 03:11:52,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:11:52,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:11:52,845 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:11:52,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:11:52,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:11:52,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:11:52,870 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-21 03:11:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:11:52,904 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-21 03:11:52,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:11:52,908 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 03:11:52,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:11:53,023 INFO L225 Difference]: With dead ends: 77 [2018-01-21 03:11:53,023 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:11:53,027 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 03:11:53,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:11:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:11:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:11:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:11:53,054 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-01-21 03:11:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:11:53,054 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:11:53,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:11:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:11:53,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:11:53,057 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:11:53,057 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:11:53,057 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:11:53,057 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:11:53,058 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:11:53,058 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:11:53,058 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:11:53,058 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 03:11:53,058 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:11:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-21 03:11:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 03:11:53,061 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:53,062 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:11:53,062 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:11:53,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1865714460, now seen corresponding path program 1 times [2018-01-21 03:11:53,062 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:53,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:53,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:53,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:53,064 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:11:53,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:11:53,109 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 03:11:53,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:11:53,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:11:53,110 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:11:53,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:11:53,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:11:53,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:11:53,111 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-21 03:11:53,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:11:53,118 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-21 03:11:53,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:11:53,118 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-01-21 03:11:53,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:11:53,120 INFO L225 Difference]: With dead ends: 77 [2018-01-21 03:11:53,120 INFO L226 Difference]: Without dead ends: 40 [2018-01-21 03:11:53,121 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 03:11:53,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-21 03:11:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-21 03:11:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-21 03:11:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-21 03:11:53,135 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 29 [2018-01-21 03:11:53,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:11:53,135 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-21 03:11:53,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:11:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-21 03:11:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 03:11:53,137 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:53,137 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:11:53,137 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:11:53,137 INFO L82 PathProgramCache]: Analyzing trace with hash -880196222, now seen corresponding path program 1 times [2018-01-21 03:11:53,137 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:53,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:53,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:53,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:53,139 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:11:53,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:11:53,311 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 03:11:53,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:11:53,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:11:53,312 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:11:53,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:11:53,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:11:53,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:11:53,318 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-21 03:11:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:11:53,521 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-01-21 03:11:53,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 03:11:53,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-21 03:11:53,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:11:53,524 INFO L225 Difference]: With dead ends: 45 [2018-01-21 03:11:53,524 INFO L226 Difference]: Without dead ends: 38 [2018-01-21 03:11:53,525 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-21 03:11:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-21 03:11:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-21 03:11:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 03:11:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-21 03:11:53,540 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2018-01-21 03:11:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:11:53,541 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-21 03:11:53,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:11:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-21 03:11:53,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 03:11:53,542 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:53,543 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:11:53,543 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:11:53,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1506938106, now seen corresponding path program 1 times [2018-01-21 03:11:53,544 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:53,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:53,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:53,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:53,546 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:11:53,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:11:53,650 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 03:11:53,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:11:53,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:11:53,650 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:11:53,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:11:53,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:11:53,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:11:53,651 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-01-21 03:11:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:11:53,723 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-21 03:11:53,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:11:53,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-21 03:11:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:11:53,728 INFO L225 Difference]: With dead ends: 65 [2018-01-21 03:11:53,728 INFO L226 Difference]: Without dead ends: 48 [2018-01-21 03:11:53,729 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 03:11:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-21 03:11:53,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-01-21 03:11:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-21 03:11:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-01-21 03:11:53,736 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2018-01-21 03:11:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:11:53,737 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-01-21 03:11:53,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:11:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-01-21 03:11:53,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 03:11:53,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:53,738 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:11:53,738 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:11:53,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1981787469, now seen corresponding path program 1 times [2018-01-21 03:11:53,739 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:53,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:53,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:53,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:53,740 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:11:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:11:53,810 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:11:53,821 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:11:53,826 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:11:53,829 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:11:53,830 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:11:53,843 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:11:53,843 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:11:53,843 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:11:53,843 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:11:53,843 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:11:53,843 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:11:53,843 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:11:53,843 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 03:11:53,843 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:11:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-21 03:11:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 03:11:53,846 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:53,846 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:11:53,846 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 03:11:53,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1942190490, now seen corresponding path program 1 times [2018-01-21 03:11:53,847 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:53,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:53,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:53,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:53,848 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:11:53,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:11:53,866 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 03:11:53,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:11:53,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:11:53,867 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:11:53,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:11:53,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:11:53,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:11:53,868 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-21 03:11:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:11:53,872 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-21 03:11:53,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:11:53,873 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-21 03:11:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:11:53,873 INFO L225 Difference]: With dead ends: 77 [2018-01-21 03:11:53,873 INFO L226 Difference]: Without dead ends: 38 [2018-01-21 03:11:53,874 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 03:11:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-21 03:11:53,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-21 03:11:53,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 03:11:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-21 03:11:53,877 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 27 [2018-01-21 03:11:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:11:53,877 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-21 03:11:53,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:11:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-21 03:11:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 03:11:53,878 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:53,878 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:11:53,878 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 03:11:53,879 INFO L82 PathProgramCache]: Analyzing trace with hash -215440820, now seen corresponding path program 1 times [2018-01-21 03:11:53,879 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:53,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:53,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:53,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:53,880 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:11:53,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:11:53,939 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 03:11:53,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:11:53,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:11:53,939 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:11:53,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:11:53,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:11:53,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:11:53,940 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-01-21 03:11:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:11:53,989 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 03:11:53,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 03:11:53,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-21 03:11:53,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:11:53,991 INFO L225 Difference]: With dead ends: 41 [2018-01-21 03:11:53,991 INFO L226 Difference]: Without dead ends: 36 [2018-01-21 03:11:53,992 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-21 03:11:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-21 03:11:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-21 03:11:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-21 03:11:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-21 03:11:53,999 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2018-01-21 03:11:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:11:53,999 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-21 03:11:54,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:11:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-21 03:11:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 03:11:54,001 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:54,001 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:11:54,001 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 03:11:54,001 INFO L82 PathProgramCache]: Analyzing trace with hash -211623728, now seen corresponding path program 1 times [2018-01-21 03:11:54,002 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:54,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:54,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:54,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:54,003 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:11:54,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:11:54,057 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 03:11:54,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:11:54,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:11:54,058 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:11:54,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:11:54,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:11:54,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:11:54,059 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-21 03:11:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:11:54,146 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-21 03:11:54,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:11:54,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-21 03:11:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:11:54,147 INFO L225 Difference]: With dead ends: 61 [2018-01-21 03:11:54,147 INFO L226 Difference]: Without dead ends: 46 [2018-01-21 03:11:54,148 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 03:11:54,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-21 03:11:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-01-21 03:11:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 03:11:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-21 03:11:54,152 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2018-01-21 03:11:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:11:54,152 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-21 03:11:54,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:11:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-21 03:11:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 03:11:54,153 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:54,154 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:11:54,154 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 03:11:54,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1396474071, now seen corresponding path program 1 times [2018-01-21 03:11:54,154 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:54,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:54,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:54,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:54,155 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:11:54,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:11:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 03:11:54,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:11:54,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 03:11:54,632 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:11:54,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-21 03:11:54,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-21 03:11:54,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-21 03:11:54,633 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 9 states. [2018-01-21 03:11:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:11:55,121 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-01-21 03:11:55,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 03:11:55,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-21 03:11:55,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:11:55,121 INFO L225 Difference]: With dead ends: 38 [2018-01-21 03:11:55,122 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:11:55,122 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-21 03:11:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:11:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:11:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:11:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:11:55,123 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-21 03:11:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:11:55,123 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:11:55,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-21 03:11:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:11:55,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:11:55,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 03:11:55 BoogieIcfgContainer [2018-01-21 03:11:55,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 03:11:55,134 INFO L168 Benchmark]: Toolchain (without parser) took 3214.24 ms. Allocated memory was 308.3 MB in the beginning and 441.5 MB in the end (delta: 133.2 MB). Free memory was 267.0 MB in the beginning and 328.7 MB in the end (delta: -61.6 MB). Peak memory consumption was 71.5 MB. Max. memory is 5.3 GB. [2018-01-21 03:11:55,136 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 308.3 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:11:55,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.74 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 257.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:11:55,137 INFO L168 Benchmark]: Boogie Preprocessor took 30.63 ms. Allocated memory is still 308.3 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:11:55,137 INFO L168 Benchmark]: RCFGBuilder took 258.46 ms. Allocated memory is still 308.3 MB. Free memory was 255.1 MB in the beginning and 238.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:11:55,138 INFO L168 Benchmark]: TraceAbstraction took 2671.85 ms. Allocated memory was 308.3 MB in the beginning and 441.5 MB in the end (delta: 133.2 MB). Free memory was 238.1 MB in the beginning and 328.7 MB in the end (delta: -90.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 5.3 GB. [2018-01-21 03:11:55,139 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 308.3 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 241.74 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 257.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.63 ms. Allocated memory is still 308.3 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 258.46 ms. Allocated memory is still 308.3 MB. Free memory was 255.1 MB in the beginning and 238.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2671.85 ms. Allocated memory was 308.3 MB in the beginning and 441.5 MB in the end (delta: 133.2 MB). Free memory was 238.1 MB in the beginning and 328.7 MB in the end (delta: -90.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 5.3 GB. * 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) - 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: [L619] int *a, *b; [L620] int n; VAL [\old(a)=4, \old(a)=7, \old(b)=3, \old(b)=2, \old(n)=5, a={0:0}, b={0:0}, n=0] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. UNSAFE Result, 0.2s 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=44occurred 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 - PositiveResult [Line: 622]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: fooErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 46 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=44occurred 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, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, n=1] [L636] a = malloc (n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, n=1] [L637] EXPR, FCALL malloc (n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L638] FCALL *b++ = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L639] CALL foo () VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L626] FCALL a[i] = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L627] COND FALSE, RET !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L639] foo () VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] EXPR, FCALL b[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=1, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] EXPR, FCALL b[n - 2] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=1, b[n - 2]=1, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] COND FALSE !(b[-1] - b[n - 2]) [L643] FCALL free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L643] FCALL free(b-1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L644] return 0; VAL [a={7:0}, b={13:4}, n=1] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. UNSAFE Result, 0.7s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 107 SDtfs, 74 SDslu, 114 SDs, 0 SdLazy, 67 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 4688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 630]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. SAFE Result, 1.2s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 97 SDslu, 149 SDs, 0 SdLazy, 239 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 14824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 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/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_03-11-55-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_03-11-55-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_03-11-55-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_03-11-55-150.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_03-11-55-150.csv Received shutdown request...