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_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test8_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 08:57:21,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 08:57:21,484 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 08:57:21,500 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 08:57:21,500 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 08:57:21,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 08:57:21,502 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 08:57:21,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 08:57:21,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 08:57:21,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 08:57:21,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 08:57:21,509 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 08:57:21,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 08:57:21,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 08:57:21,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 08:57:21,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 08:57:21,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 08:57:21,518 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 08:57:21,519 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 08:57:21,520 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 08:57:21,522 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 08:57:21,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 08:57:21,523 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 08:57:21,524 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 08:57:21,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 08:57:21,526 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 08:57:21,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 08:57:21,527 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 08:57:21,527 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 08:57:21,527 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 08:57:21,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 08:57:21,528 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_preciseopt.epf [2018-01-21 08:57:21,538 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 08:57:21,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 08:57:21,539 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 08:57:21,540 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 08:57:21,540 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 08:57:21,540 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 08:57:21,540 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-21 08:57:21,540 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 08:57:21,541 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 08:57:21,541 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 08:57:21,542 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 08:57:21,542 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 08:57:21,542 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 08:57:21,542 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 08:57:21,542 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 08:57:21,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 08:57:21,543 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 08:57:21,543 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 08:57:21,543 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 08:57:21,543 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 08:57:21,543 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 08:57:21,544 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 08:57:21,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 08:57:21,544 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 08:57:21,544 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 08:57:21,545 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 08:57:21,545 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 08:57:21,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 08:57:21,545 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 08:57:21,545 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 08:57:21,546 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 08:57:21,546 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 08:57:21,546 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 08:57:21,546 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 08:57:21,546 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 08:57:21,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 08:57:21,547 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 08:57:21,547 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 08:57:21,548 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 08:57:21,548 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 08:57:21,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 08:57:21,598 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 08:57:21,602 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 08:57:21,604 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 08:57:21,604 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 08:57:21,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test8_true-valid-memsafety_true-termination.i [2018-01-21 08:57:21,817 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 08:57:21,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 08:57:21,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 08:57:21,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 08:57:21,830 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 08:57:21,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:57:21" (1/1) ... [2018-01-21 08:57:21,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f922628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:21, skipping insertion in model container [2018-01-21 08:57:21,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:57:21" (1/1) ... [2018-01-21 08:57:21,854 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:57:21,908 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:57:22,030 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:57:22,044 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:57:22,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:22 WrapperNode [2018-01-21 08:57:22,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 08:57:22,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 08:57:22,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 08:57:22,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 08:57:22,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:22" (1/1) ... [2018-01-21 08:57:22,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:22" (1/1) ... [2018-01-21 08:57:22,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:22" (1/1) ... [2018-01-21 08:57:22,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:22" (1/1) ... [2018-01-21 08:57:22,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:22" (1/1) ... [2018-01-21 08:57:22,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:22" (1/1) ... [2018-01-21 08:57:22,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:22" (1/1) ... [2018-01-21 08:57:22,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 08:57:22,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 08:57:22,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 08:57:22,089 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 08:57:22,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:22" (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 08:57:22,136 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 08:57:22,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 08:57:22,137 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 08:57:22,137 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_8 [2018-01-21 08:57:22,137 INFO L136 BoogieDeclarations]: Found implementation of procedure free_8 [2018-01-21 08:57:22,137 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 08:57:22,137 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 08:57:22,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 08:57:22,137 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 08:57:22,137 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 08:57:22,137 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 08:57:22,138 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 08:57:22,138 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 08:57:22,138 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 08:57:22,138 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_8 [2018-01-21 08:57:22,138 INFO L128 BoogieDeclarations]: Found specification of procedure free_8 [2018-01-21 08:57:22,138 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 08:57:22,138 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 08:57:22,139 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 08:57:22,139 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 08:57:22,307 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 08:57:22,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:57:22 BoogieIcfgContainer [2018-01-21 08:57:22,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 08:57:22,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 08:57:22,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 08:57:22,310 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 08:57:22,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 08:57:21" (1/3) ... [2018-01-21 08:57:22,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e74d559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:57:22, skipping insertion in model container [2018-01-21 08:57:22,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:57:22" (2/3) ... [2018-01-21 08:57:22,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e74d559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:57:22, skipping insertion in model container [2018-01-21 08:57:22,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:57:22" (3/3) ... [2018-01-21 08:57:22,313 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test8_true-valid-memsafety_true-termination.i [2018-01-21 08:57:22,320 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 08:57:22,327 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-21 08:57:22,378 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:22,378 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:22,378 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:22,378 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:22,378 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:22,379 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:22,379 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:22,379 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_8Err0EnsuresViolation======== [2018-01-21 08:57:22,380 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-01-21 08:57:22,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 08:57:22,407 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:22,408 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:22,408 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_8Err0EnsuresViolation]=== [2018-01-21 08:57:22,413 INFO L82 PathProgramCache]: Analyzing trace with hash 965641135, now seen corresponding path program 1 times [2018-01-21 08:57:22,416 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:22,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:22,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:22,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:22,472 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:22,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:22,592 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 08:57:22,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:22,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:57:22,595 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:22,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:57:22,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:57:22,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:22,613 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-01-21 08:57:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:22,831 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-01-21 08:57:22,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:57:22,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-01-21 08:57:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:22,840 INFO L225 Difference]: With dead ends: 40 [2018-01-21 08:57:22,840 INFO L226 Difference]: Without dead ends: 23 [2018-01-21 08:57:22,843 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-01-21 08:57:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-01-21 08:57:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-01-21 08:57:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-01-21 08:57:22,869 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2018-01-21 08:57:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:22,870 INFO L432 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-01-21 08:57:22,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:57:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-01-21 08:57:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 08:57:22,871 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:22,871 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 08:57:22,871 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_8Err0EnsuresViolation]=== [2018-01-21 08:57:22,872 INFO L82 PathProgramCache]: Analyzing trace with hash -129898917, now seen corresponding path program 1 times [2018-01-21 08:57:22,872 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:22,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:22,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:22,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:22,874 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:22,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:23,000 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 08:57:23,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:23,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:57:23,001 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:23,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 08:57:23,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 08:57:23,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 08:57:23,004 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 5 states. [2018-01-21 08:57:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:23,075 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2018-01-21 08:57:23,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:57:23,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-21 08:57:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:23,077 INFO L225 Difference]: With dead ends: 32 [2018-01-21 08:57:23,077 INFO L226 Difference]: Without dead ends: 22 [2018-01-21 08:57:23,078 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-21 08:57:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-01-21 08:57:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-01-21 08:57:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-01-21 08:57:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2018-01-21 08:57:23,082 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 19 [2018-01-21 08:57:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:23,083 INFO L432 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2018-01-21 08:57:23,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 08:57:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2018-01-21 08:57:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 08:57:23,083 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:23,084 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 08:57:23,084 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_8Err0EnsuresViolation]=== [2018-01-21 08:57:23,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1314343011, now seen corresponding path program 1 times [2018-01-21 08:57:23,084 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:23,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,085 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:23,085 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,085 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:23,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:23,156 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 08:57:23,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:23,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 08:57:23,156 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:23,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 08:57:23,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 08:57:23,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:57:23,157 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand 4 states. [2018-01-21 08:57:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:23,177 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2018-01-21 08:57:23,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 08:57:23,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-21 08:57:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:23,178 INFO L225 Difference]: With dead ends: 22 [2018-01-21 08:57:23,178 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:57:23,178 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:57:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:57:23,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:57:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:57:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:57:23,179 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-01-21 08:57:23,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:23,179 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:57:23,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 08:57:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:57:23,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:57:23,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 08:57:23,351 INFO L401 ceAbstractionStarter]: For program point L1441''(line 1441) no Hoare annotation was computed. [2018-01-21 08:57:23,351 INFO L401 ceAbstractionStarter]: For program point free_8Err0EnsuresViolation(lines 1440 1442) no Hoare annotation was computed. [2018-01-21 08:57:23,352 INFO L397 ceAbstractionStarter]: At program point free_8ENTRY(lines 1440 1442) the Hoare annotation is: (or (not (= 0 ~a8.offset)) (not (= 0 ~a8.base)) (= |#valid| |old(#valid)|)) [2018-01-21 08:57:23,352 INFO L401 ceAbstractionStarter]: For program point free_8EXIT(lines 1440 1442) no Hoare annotation was computed. [2018-01-21 08:57:23,352 INFO L401 ceAbstractionStarter]: For program point L1441(line 1441) no Hoare annotation was computed. [2018-01-21 08:57:23,352 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (or (not (= 0 ~a8.offset)) (not (= 0 ~a8.base)) (= |#valid| |old(#valid)|)) [2018-01-21 08:57:23,352 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 08:57:23,353 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 08:57:23,353 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 08:57:23,353 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 08:57:23,353 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 08:57:23,353 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 08:57:23,353 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1452) no Hoare annotation was computed. [2018-01-21 08:57:23,353 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1452) no Hoare annotation was computed. [2018-01-21 08:57:23,353 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1452) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 08:57:23,354 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1452) no Hoare annotation was computed. [2018-01-21 08:57:23,354 INFO L401 ceAbstractionStarter]: For program point alloc_8Err0EnsuresViolation(lines 1436 1438) no Hoare annotation was computed. [2018-01-21 08:57:23,354 INFO L397 ceAbstractionStarter]: At program point alloc_8ENTRY(lines 1436 1438) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-21 08:57:23,354 INFO L401 ceAbstractionStarter]: For program point alloc_8EXIT(lines 1436 1438) no Hoare annotation was computed. [2018-01-21 08:57:23,354 INFO L401 ceAbstractionStarter]: For program point L1437(line 1437) no Hoare annotation was computed. [2018-01-21 08:57:23,354 INFO L401 ceAbstractionStarter]: For program point alloc_8FINAL(lines 1436 1438) no Hoare annotation was computed. [2018-01-21 08:57:23,355 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1452) the Hoare annotation is: true [2018-01-21 08:57:23,355 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1452) no Hoare annotation was computed. [2018-01-21 08:57:23,355 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1452) the Hoare annotation is: (and (= ~a8.offset 0) (= 0 ~a8.base)) [2018-01-21 08:57:23,355 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1452) no Hoare annotation was computed. [2018-01-21 08:57:23,355 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1452) no Hoare annotation was computed. [2018-01-21 08:57:23,355 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1450 1452) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-21 08:57:23,355 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1450 1452) no Hoare annotation was computed. [2018-01-21 08:57:23,356 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1450 1452) no Hoare annotation was computed. [2018-01-21 08:57:23,356 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1450 1452) no Hoare annotation was computed. [2018-01-21 08:57:23,356 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1444 1448) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-21 08:57:23,357 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1444 1448) no Hoare annotation was computed. [2018-01-21 08:57:23,357 INFO L397 ceAbstractionStarter]: At program point L1445(line 1445) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-21 08:57:23,357 INFO L401 ceAbstractionStarter]: For program point L1446(line 1446) no Hoare annotation was computed. [2018-01-21 08:57:23,358 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1444 1448) no Hoare annotation was computed. [2018-01-21 08:57:23,358 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1444 1448) no Hoare annotation was computed. [2018-01-21 08:57:23,361 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:23,361 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:23,361 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:23,361 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:23,361 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:23,361 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:23,362 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:23,362 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 08:57:23,362 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-01-21 08:57:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 08:57:23,364 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:23,364 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:23,364 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 08:57:23,364 INFO L82 PathProgramCache]: Analyzing trace with hash -47768739, now seen corresponding path program 1 times [2018-01-21 08:57:23,365 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:23,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:23,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,366 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:23,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:23,401 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 08:57:23,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:23,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:57:23,401 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:23,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:57:23,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:57:23,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:23,402 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-01-21 08:57:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:23,484 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-01-21 08:57:23,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:57:23,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 08:57:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:23,486 INFO L225 Difference]: With dead ends: 40 [2018-01-21 08:57:23,486 INFO L226 Difference]: Without dead ends: 14 [2018-01-21 08:57:23,487 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-01-21 08:57:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-01-21 08:57:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-01-21 08:57:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2018-01-21 08:57:23,490 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 11 [2018-01-21 08:57:23,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:23,490 INFO L432 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2018-01-21 08:57:23,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:57:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-01-21 08:57:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 08:57:23,491 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:23,491 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:23,491 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 08:57:23,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1338789535, now seen corresponding path program 1 times [2018-01-21 08:57:23,492 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:23,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:23,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,493 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:57:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:57:23,543 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:57:23,551 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:23,553 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:23,564 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:23,564 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:23,564 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:23,564 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:23,564 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:23,564 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:23,565 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:23,565 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 08:57:23,565 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-01-21 08:57:23,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 08:57:23,566 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:23,566 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 08:57:23,566 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 08:57:23,566 INFO L82 PathProgramCache]: Analyzing trace with hash 69994, now seen corresponding path program 1 times [2018-01-21 08:57:23,566 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:23,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:23,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,568 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:57:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:57:23,576 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:57:23,577 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:23,579 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:23,580 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:23,580 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:23,580 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:23,580 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:23,580 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:23,580 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:23,580 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_8Err0EnsuresViolation======== [2018-01-21 08:57:23,581 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-01-21 08:57:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 08:57:23,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:23,583 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:57:23,583 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_8Err0EnsuresViolation]=== [2018-01-21 08:57:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1444321524, now seen corresponding path program 1 times [2018-01-21 08:57:23,583 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:23,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:23,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,585 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:23,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:23,615 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 08:57:23,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:23,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:57:23,616 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:23,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:57:23,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:57:23,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:23,617 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-01-21 08:57:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:23,674 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-01-21 08:57:23,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:57:23,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-21 08:57:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:23,676 INFO L225 Difference]: With dead ends: 40 [2018-01-21 08:57:23,676 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:57:23,676 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:23,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:57:23,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:57:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:57:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:57:23,677 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-21 08:57:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:23,678 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:57:23,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:57:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:57:23,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:57:23,680 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:23,680 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:23,681 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:23,681 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:23,681 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:23,681 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:23,681 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:23,681 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 08:57:23,682 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-01-21 08:57:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 08:57:23,685 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:23,685 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] [2018-01-21 08:57:23,685 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:57:23,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2031870628, now seen corresponding path program 1 times [2018-01-21 08:57:23,685 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:23,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:23,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,688 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:57:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:57:23,715 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:57:23,719 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:23,720 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:23,721 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:23,722 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:23,723 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:23,723 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:23,724 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:57:23,729 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:23,729 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:23,729 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:23,729 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:23,730 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:23,730 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:23,730 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:23,730 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 08:57:23,730 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-01-21 08:57:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 08:57:23,732 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:23,733 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] [2018-01-21 08:57:23,733 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 08:57:23,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1168834090, now seen corresponding path program 1 times [2018-01-21 08:57:23,733 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:23,734 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:23,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,735 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:23,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:23,781 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 08:57:23,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:23,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:57:23,781 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:23,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:57:23,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:57:23,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:23,783 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-01-21 08:57:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:23,838 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-01-21 08:57:23,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:57:23,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-21 08:57:23,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:23,839 INFO L225 Difference]: With dead ends: 40 [2018-01-21 08:57:23,840 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:57:23,840 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:57:23,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:57:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:57:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:57:23,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 08:57:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:23,841 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:57:23,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:57:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:57:23,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:57:23,843 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:57:23,843 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:57:23,843 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:57:23,844 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:57:23,844 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:57:23,844 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:57:23,844 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:57:23,844 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 08:57:23,844 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:57:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-01-21 08:57:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 08:57:23,847 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:57:23,847 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 08:57:23,847 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 08:57:23,847 INFO L82 PathProgramCache]: Analyzing trace with hash -275878396, now seen corresponding path program 1 times [2018-01-21 08:57:23,847 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:57:23,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:57:23,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:57:23,849 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:57:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:57:23,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:57:23,886 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 08:57:23,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:57:23,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:57:23,886 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:57:23,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 08:57:23,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 08:57:23,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:23,887 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-01-21 08:57:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:57:23,957 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-01-21 08:57:23,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 08:57:23,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-21 08:57:23,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:57:23,958 INFO L225 Difference]: With dead ends: 40 [2018-01-21 08:57:23,959 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:57:23,959 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 08:57:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:57:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:57:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:57:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:57:23,960 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-01-21 08:57:23,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:57:23,960 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:57:23,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 08:57:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:57:23,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:57:23,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 08:57:23 BoogieIcfgContainer [2018-01-21 08:57:23,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 08:57:23,964 INFO L168 Benchmark]: Toolchain (without parser) took 2146.86 ms. Allocated memory was 304.6 MB in the beginning and 462.4 MB in the end (delta: 157.8 MB). Free memory was 261.8 MB in the beginning and 322.5 MB in the end (delta: -60.8 MB). Peak memory consumption was 97.0 MB. Max. memory is 5.3 GB. [2018-01-21 08:57:23,966 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 304.6 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 08:57:23,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.51 ms. Allocated memory is still 304.6 MB. Free memory was 261.8 MB in the beginning and 249.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-21 08:57:23,967 INFO L168 Benchmark]: Boogie Preprocessor took 34.29 ms. Allocated memory is still 304.6 MB. Free memory was 249.7 MB in the beginning and 247.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 08:57:23,967 INFO L168 Benchmark]: RCFGBuilder took 219.75 ms. Allocated memory is still 304.6 MB. Free memory was 247.7 MB in the beginning and 232.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-21 08:57:23,967 INFO L168 Benchmark]: TraceAbstraction took 1654.70 ms. Allocated memory was 304.6 MB in the beginning and 462.4 MB in the end (delta: 157.8 MB). Free memory was 232.7 MB in the beginning and 322.5 MB in the end (delta: -89.9 MB). Peak memory consumption was 68.0 MB. Max. memory is 5.3 GB. [2018-01-21 08:57:23,969 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.20 ms. Allocated memory is still 304.6 MB. Free memory is still 268.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.51 ms. Allocated memory is still 304.6 MB. Free memory was 261.8 MB in the beginning and 249.7 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.29 ms. Allocated memory is still 304.6 MB. Free memory was 249.7 MB in the beginning and 247.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 219.75 ms. Allocated memory is still 304.6 MB. Free memory was 247.7 MB in the beginning and 232.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1654.70 ms. Allocated memory was 304.6 MB in the beginning and 462.4 MB in the end (delta: 157.8 MB). Free memory was 232.7 MB in the beginning and 322.5 MB in the end (delta: -89.9 MB). Peak memory consumption was 68.0 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) - 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: - PositiveResult [Line: 1440]: 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: free_8Err0EnsuresViolation CFG has 7 procedures, 36 locations, 7 error locations. SAFE Result, 0.9s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 53 SDtfs, 25 SDslu, 49 SDs, 0 SdLazy, 41 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 10 PreInvPairs, 11 NumberOfFragments, 111 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 2077 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 - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1434] int *a8; VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1451] CALL entry_point() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1445] CALL alloc_8() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1437] CALL ldv_malloc(sizeof(int)) VAL [\old(a8)=0, \old(a8)=0, \old(size)=4, a8={0:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(a8)=0, \old(a8)=0, \old(size)=4, a8={0:0}, malloc(size)={7:0}, size=4] [L1074] return malloc(size); VAL [\old(a8)=0, \old(a8)=0, \old(size)=4, \result={7:0}, a8={0:0}, malloc(size)={7:0}, size=4] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 7 procedures, 36 locations, 7 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22 SDtfs, 10 SDslu, 1 SDs, 0 SdLazy, 21 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 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: [L1434] int *a8; VAL [\old(a8)=3, \old(a8)=1, a8={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 7 procedures, 36 locations, 7 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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: 1436]: 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: alloc_8Err0EnsuresViolation CFG has 7 procedures, 36 locations, 7 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22 SDtfs, 8 SDslu, 1 SDs, 0 SdLazy, 21 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 351 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: [L1434] int *a8; VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1451] CALL entry_point() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1445] CALL alloc_8() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1437] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(a8)=0, \old(a8)=0, \old(size)=4, a8={0:0}] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(a8)=0, \old(a8)=0, \old(size)=4, \result={0:0}, a8={0:0}, size=4] [L1437] EXPR ldv_malloc(sizeof(int)) VAL [\old(a8)=0, \old(a8)=0, a8={0:0}, ldv_malloc(sizeof(int))={0:0}] [L1437] RET a8 = (int *)ldv_malloc(sizeof(int)) [L1445] alloc_8() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1446] CALL free_8() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1441] COND FALSE, RET !(\read(*a8)) VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1446] free_8() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1447] RET a8 = 0 VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1451] entry_point() VAL [a8={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 36 locations, 7 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 25 NumberOfCodeBlocks, 25 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: 1450]: 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 7 procedures, 36 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22 SDtfs, 3 SDslu, 1 SDs, 0 SdLazy, 21 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 1276 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 - PositiveResult [Line: 1444]: 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: entry_pointErr0EnsuresViolation CFG has 7 procedures, 36 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22 SDtfs, 4 SDslu, 1 SDs, 0 SdLazy, 21 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 1000 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 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_08-57-23-981.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_08-57-23-981.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_08-57-23-981.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_08-57-23-981.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_08-57-23-981.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_08-57-23-981.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_08-57-23-981.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_08-57-23-981.csv Received shutdown request...