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/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:29:29,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:29:29,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:29:29,521 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:29:29,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:29:29,522 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:29:29,523 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:29:29,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:29:29,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:29:29,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:29:29,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:29:29,529 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:29:29,530 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:29:29,531 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:29:29,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:29:29,535 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:29:29,537 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:29:29,539 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:29:29,540 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:29:29,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:29:29,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:29:29,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:29:29,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:29:29,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:29:29,546 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:29:29,548 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:29:29,548 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:29:29,549 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:29:29,549 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:29:29,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:29:29,550 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:29:29,550 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:29:29,559 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:29:29,559 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:29:29,560 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:29:29,560 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:29:29,560 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:29:29,560 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:29:29,560 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:29:29,561 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:29:29,561 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:29:29,561 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:29:29,561 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:29:29,561 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:29:29,562 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:29:29,562 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:29:29,562 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:29:29,562 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:29:29,562 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:29:29,562 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:29:29,562 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:29:29,562 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:29:29,563 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:29:29,563 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:29:29,563 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:29:29,563 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:29:29,563 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:29:29,564 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:29:29,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:29:29,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:29:29,564 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:29:29,564 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:29:29,564 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:29:29,564 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:29:29,564 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:29:29,565 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:29:29,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:29:29,565 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:29:29,565 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:29:29,566 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:29:29,566 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:29:29,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:29:29,610 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:29:29,614 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:29:29,615 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:29:29,616 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:29:29,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:29:29,778 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:29:29,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:29:29,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:29:29,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:29:29,787 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:29:29,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:29:29" (1/1) ... [2018-01-21 00:29:29,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793dbc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:29, skipping insertion in model container [2018-01-21 00:29:29,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:29:29" (1/1) ... [2018-01-21 00:29:29,805 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:29:29,842 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:29:29,953 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:29:29,969 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:29:29,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:29 WrapperNode [2018-01-21 00:29:29,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:29:29,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:29:29,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:29:29,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:29:29,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:29" (1/1) ... [2018-01-21 00:29:29,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:29" (1/1) ... [2018-01-21 00:29:29,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:29" (1/1) ... [2018-01-21 00:29:29,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:29" (1/1) ... [2018-01-21 00:29:30,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:29" (1/1) ... [2018-01-21 00:29:30,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:29" (1/1) ... [2018-01-21 00:29:30,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:29" (1/1) ... [2018-01-21 00:29:30,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:29:30,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:29:30,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:29:30,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:29:30,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:29" (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:29:30,054 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:29:30,054 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:29:30,054 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-21 00:29:30,054 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:29:30,054 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:29:30,054 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:29:30,054 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:29:30,054 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:29:30,054 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:29:30,054 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:29:30,055 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-21 00:29:30,055 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:29:30,055 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:29:30,055 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:29:30,209 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:29:30,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:29:30 BoogieIcfgContainer [2018-01-21 00:29:30,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:29:30,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:29:30,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:29:30,212 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:29:30,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:29:29" (1/3) ... [2018-01-21 00:29:30,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdd1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:29:30, skipping insertion in model container [2018-01-21 00:29:30,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:29" (2/3) ... [2018-01-21 00:29:30,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fdd1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:29:30, skipping insertion in model container [2018-01-21 00:29:30,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:29:30" (3/3) ... [2018-01-21 00:29:30,215 INFO L105 eAbstractionObserver]: Analyzing ICFG array01-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:29:30,222 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:29:30,229 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:29:30,278 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:30,278 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:30,278 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:30,279 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:30,279 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:30,279 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:30,279 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:30,279 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:29:30,280 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-01-21 00:29:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:29:30,307 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:30,308 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:29:30,308 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:29:30,313 INFO L82 PathProgramCache]: Analyzing trace with hash 84570, now seen corresponding path program 1 times [2018-01-21 00:29:30,316 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:30,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:30,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:30,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:30,368 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:30,426 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:29:30,432 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:30,438 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:30,438 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:30,438 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:30,439 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:30,439 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:30,439 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:30,439 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:30,439 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == test_funErr0EnsuresViolation======== [2018-01-21 00:29:30,439 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-01-21 00:29:30,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 00:29:30,441 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:30,441 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:30,441 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr0EnsuresViolation]=== [2018-01-21 00:29:30,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1019429665, now seen corresponding path program 1 times [2018-01-21 00:29:30,442 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:30,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:30,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:30,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:30,443 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:30,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:30,499 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:29:30,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:30,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:30,501 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:30,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:30,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:30,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:30,517 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-01-21 00:29:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:30,543 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-01-21 00:29:30,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:30,545 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-21 00:29:30,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:30,553 INFO L225 Difference]: With dead ends: 57 [2018-01-21 00:29:30,553 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:29:30,556 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:29:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:29:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:29:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:29:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:29:30,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-21 00:29:30,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:30,660 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:29:30,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:29:30,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:29:30,662 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:30,662 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:30,663 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:30,663 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:30,663 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:30,663 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:30,663 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:30,663 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:29:30,663 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-01-21 00:29:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 00:29:30,666 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:30,666 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:30,666 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash -16824561, now seen corresponding path program 1 times [2018-01-21 00:29:30,666 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:30,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:30,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:30,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:30,668 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:30,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:30,701 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:29:30,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:30,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:30,702 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:30,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:30,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:30,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:30,703 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-01-21 00:29:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:30,708 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-01-21 00:29:30,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:30,708 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 00:29:30,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:30,711 INFO L225 Difference]: With dead ends: 57 [2018-01-21 00:29:30,711 INFO L226 Difference]: Without dead ends: 31 [2018-01-21 00:29:30,711 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:29:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-21 00:29:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-21 00:29:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 00:29:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-01-21 00:29:30,720 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 21 [2018-01-21 00:29:30,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:30,720 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-01-21 00:29:30,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-01-21 00:29:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 00:29:30,721 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:30,721 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] [2018-01-21 00:29:30,722 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash -728021691, now seen corresponding path program 1 times [2018-01-21 00:29:30,722 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:30,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:30,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:30,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:30,723 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:30,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:30,835 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:29:30,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:30,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:29:30,835 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:30,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:29:30,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:29:30,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:29:30,838 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 5 states. [2018-01-21 00:29:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:30,943 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-21 00:29:30,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:29:30,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-21 00:29:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:30,945 INFO L225 Difference]: With dead ends: 51 [2018-01-21 00:29:30,945 INFO L226 Difference]: Without dead ends: 41 [2018-01-21 00:29:30,946 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 00:29:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-21 00:29:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-01-21 00:29:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-21 00:29:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-01-21 00:29:30,952 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-01-21 00:29:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:30,953 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-01-21 00:29:30,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:29:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-01-21 00:29:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 00:29:30,954 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:30,954 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] [2018-01-21 00:29:30,955 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:30,955 INFO L82 PathProgramCache]: Analyzing trace with hash 143407380, now seen corresponding path program 1 times [2018-01-21 00:29:30,955 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:30,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:30,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:30,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:30,956 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:31,004 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:29:31,010 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:31,013 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:31,014 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:31,015 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:31,025 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:31,025 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:31,026 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:31,026 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:31,026 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:31,026 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:31,026 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:31,026 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:29:31,026 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-01-21 00:29:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 00:29:31,029 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:31,029 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 00:29:31,029 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash 799981603, now seen corresponding path program 1 times [2018-01-21 00:29:31,030 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:31,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:31,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:31,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:31,032 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:31,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:31,055 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:29:31,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:31,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:31,056 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:31,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:31,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:31,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:31,057 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-01-21 00:29:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:31,061 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-01-21 00:29:31,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:31,061 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 00:29:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:31,062 INFO L225 Difference]: With dead ends: 57 [2018-01-21 00:29:31,062 INFO L226 Difference]: Without dead ends: 29 [2018-01-21 00:29:31,063 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:29:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-21 00:29:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-21 00:29:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-21 00:29:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-01-21 00:29:31,067 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 19 [2018-01-21 00:29:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:31,067 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-01-21 00:29:31,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-01-21 00:29:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:29:31,068 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:31,068 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:29:31,068 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:31,068 INFO L82 PathProgramCache]: Analyzing trace with hash 830526425, now seen corresponding path program 1 times [2018-01-21 00:29:31,068 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:31,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:31,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:31,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:31,070 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:31,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:31,137 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:29:31,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:31,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:29:31,138 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:31,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:29:31,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:29:31,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:29:31,139 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2018-01-21 00:29:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:31,186 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-21 00:29:31,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:29:31,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-21 00:29:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:31,187 INFO L225 Difference]: With dead ends: 47 [2018-01-21 00:29:31,187 INFO L226 Difference]: Without dead ends: 39 [2018-01-21 00:29:31,188 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 00:29:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-21 00:29:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2018-01-21 00:29:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 00:29:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-01-21 00:29:31,191 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-01-21 00:29:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:31,192 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-01-21 00:29:31,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:29:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-01-21 00:29:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:29:31,192 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:31,193 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] [2018-01-21 00:29:31,193 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:31,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1184207000, now seen corresponding path program 1 times [2018-01-21 00:29:31,193 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:31,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:31,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:31,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:31,194 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:31,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:31,285 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 00:29:31,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:31,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:29:31,285 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:31,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:29:31,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:29:31,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:29:31,286 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2018-01-21 00:29:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:31,362 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-01-21 00:29:31,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:29:31,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-21 00:29:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:31,363 INFO L225 Difference]: With dead ends: 31 [2018-01-21 00:29:31,363 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:29:31,363 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:29:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:29:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:29:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:29:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:29:31,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-21 00:29:31,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:31,364 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:29:31,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:29:31,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:29:31,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:29:31,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:29:31 BoogieIcfgContainer [2018-01-21 00:29:31,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:29:31,367 INFO L168 Benchmark]: Toolchain (without parser) took 1588.63 ms. Allocated memory was 302.0 MB in the beginning and 461.9 MB in the end (delta: 159.9 MB). Free memory was 259.9 MB in the beginning and 371.8 MB in the end (delta: -111.9 MB). Peak memory consumption was 48.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:31,368 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 302.0 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:29:31,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.34 ms. Allocated memory is still 302.0 MB. Free memory was 258.9 MB in the beginning and 248.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:31,368 INFO L168 Benchmark]: Boogie Preprocessor took 29.17 ms. Allocated memory is still 302.0 MB. Free memory was 248.9 MB in the beginning and 248.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-21 00:29:31,369 INFO L168 Benchmark]: RCFGBuilder took 202.57 ms. Allocated memory is still 302.0 MB. Free memory was 248.0 MB in the beginning and 232.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:31,369 INFO L168 Benchmark]: TraceAbstraction took 1156.19 ms. Allocated memory was 302.0 MB in the beginning and 461.9 MB in the end (delta: 159.9 MB). Free memory was 232.6 MB in the beginning and 371.8 MB in the end (delta: -139.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:31,370 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.14 ms. Allocated memory is still 302.0 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 195.34 ms. Allocated memory is still 302.0 MB. Free memory was 258.9 MB in the beginning and 248.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.17 ms. Allocated memory is still 302.0 MB. Free memory was 248.9 MB in the beginning and 248.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 202.57 ms. Allocated memory is still 302.0 MB. Free memory was 248.0 MB in the beginning and 232.6 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1156.19 ms. Allocated memory was 302.0 MB in the beginning and 461.9 MB in the end (delta: 159.9 MB). Free memory was 232.6 MB in the beginning and 371.8 MB in the end (delta: -139.3 MB). Peak memory consumption was 20.7 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: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 35 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred 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: 540]: 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: test_funErr0EnsuresViolation CFG has 4 procedures, 35 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 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=35occurred 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, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 169 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: [L553] int array_size = __VERIFIER_nondet_int(); [L554] COND TRUE array_size < 1 || array_size >= 2147483647 / sizeof(int) [L555] array_size = 1 VAL [array_size=1] [L557] EXPR, FCALL __builtin_alloca (array_size * sizeof(int)) VAL [__builtin_alloca (array_size * sizeof(int))={6:0}, array_size=1] [L557] int* numbers = (int*) __builtin_alloca (array_size * sizeof(int)); VAL [__builtin_alloca (array_size * sizeof(int))={6:0}, array_size=1, numbers={6:0}] [L558] CALL test_fun(numbers, array_size) VAL [\old(N)=1, a={6:0}] [L542] int i; [L543] int res = 0; [L544] i = 0 VAL [\old(N)=1, a={6:0}, a={6:0}, i=0, N=1, res=0] [L544] COND TRUE i < N VAL [\old(N)=1, a={6:0}, a={6:0}, i=0, N=1, res=0] [L545] EXPR, FCALL a[i] VAL [\old(N)=1, a={6:0}, a={6:0}, a[i]=0, i=0, N=1, res=0] [L545] COND FALSE !(a[i] > 0) [L544] i++ VAL [\old(N)=1, a={6:0}, a={6:0}, i=1, N=1, res=0] [L544] COND FALSE !(i < N) VAL [\old(N)=1, a={6:0}, a={6:0}, i=1, N=1, res=0] [L550] RET return res; VAL [\old(N)=1, \result=0, a={6:0}, a={6:0}, i=1, N=1, res=0] [L558] test_fun(numbers, array_size) - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 35 locations, 4 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 16 SDslu, 66 SDs, 0 SdLazy, 30 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred 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, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 1345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 552]: 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, 35 locations, 4 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 85 SDtfs, 32 SDslu, 64 SDs, 0 SdLazy, 62 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 3066 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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/array01-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-29-31-377.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-29-31-377.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-29-31-377.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-29-31-377.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-29-31-377.csv Received shutdown request...