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.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test5_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:58:36,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:58:36,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:58:36,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:58:36,315 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:58:36,316 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:58:36,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:58:36,318 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:58:36,320 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:58:36,321 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:58:36,322 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:58:36,322 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:58:36,323 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:58:36,325 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:58:36,325 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:58:36,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:58:36,330 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:58:36,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:58:36,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:58:36,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:58:36,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:58:36,338 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:58:36,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:58:36,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:58:36,340 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:58:36,341 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:58:36,342 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:58:36,342 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:58:36,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:58:36,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:58:36,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:58:36,344 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.epf [2018-01-20 23:58:36,352 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:58:36,353 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:58:36,353 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:58:36,354 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:58:36,354 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:58:36,354 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:58:36,354 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:58:36,355 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:58:36,355 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:58:36,355 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:58:36,355 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:58:36,355 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:58:36,355 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:58:36,356 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:58:36,356 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:58:36,356 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:58:36,356 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:58:36,356 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:58:36,356 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:58:36,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:58:36,357 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:58:36,357 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:58:36,357 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:58:36,357 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:58:36,357 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:58:36,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:58:36,358 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:58:36,358 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:58:36,358 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:58:36,358 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:58:36,358 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:58:36,358 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:58:36,359 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:58:36,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:58:36,359 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:58:36,359 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:58:36,360 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:58:36,360 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:58:36,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:58:36,405 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:58:36,408 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:58:36,410 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:58:36,410 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:58:36,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test5_2_false-valid-memtrack_true-termination.i [2018-01-20 23:58:36,588 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:58:36,591 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:58:36,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:58:36,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:58:36,597 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:58:36,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:58:36" (1/1) ... [2018-01-20 23:58:36,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4b3da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:36, skipping insertion in model container [2018-01-20 23:58:36,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:58:36" (1/1) ... [2018-01-20 23:58:36,614 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:58:36,663 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:58:36,776 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:58:36,789 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:58:36,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:36 WrapperNode [2018-01-20 23:58:36,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:58:36,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:58:36,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:58:36,796 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:58:36,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:36" (1/1) ... [2018-01-20 23:58:36,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:36" (1/1) ... [2018-01-20 23:58:36,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:36" (1/1) ... [2018-01-20 23:58:36,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:36" (1/1) ... [2018-01-20 23:58:36,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:36" (1/1) ... [2018-01-20 23:58:36,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:36" (1/1) ... [2018-01-20 23:58:36,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:36" (1/1) ... [2018-01-20 23:58:36,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:58:36,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:58:36,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:58:36,829 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:58:36,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:36" (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-20 23:58:36,881 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:58:36,882 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:58:36,882 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-20 23:58:36,882 INFO L136 BoogieDeclarations]: Found implementation of procedure f5 [2018-01-20 23:58:36,882 INFO L136 BoogieDeclarations]: Found implementation of procedure g5 [2018-01-20 23:58:36,882 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-20 23:58:36,882 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:58:36,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:58:36,882 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:58:36,882 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:58:36,883 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:58:36,883 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:58:36,883 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:58:36,883 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-20 23:58:36,883 INFO L128 BoogieDeclarations]: Found specification of procedure f5 [2018-01-20 23:58:36,883 INFO L128 BoogieDeclarations]: Found specification of procedure g5 [2018-01-20 23:58:36,883 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-20 23:58:36,883 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:58:36,883 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:58:36,883 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:58:37,046 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:58:37,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:58:37 BoogieIcfgContainer [2018-01-20 23:58:37,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:58:37,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:58:37,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:58:37,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:58:37,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:58:36" (1/3) ... [2018-01-20 23:58:37,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4a65e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:58:37, skipping insertion in model container [2018-01-20 23:58:37,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:36" (2/3) ... [2018-01-20 23:58:37,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4a65e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:58:37, skipping insertion in model container [2018-01-20 23:58:37,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:58:37" (3/3) ... [2018-01-20 23:58:37,052 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test5_2_false-valid-memtrack_true-termination.i [2018-01-20 23:58:37,058 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:58:37,064 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-20 23:58:37,116 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:37,116 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:37,116 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:37,117 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:37,117 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:37,117 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:37,117 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:37,117 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-20 23:58:37,118 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-20 23:58:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-20 23:58:37,146 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:37,147 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:58:37,147 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:58:37,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1245989314, now seen corresponding path program 1 times [2018-01-20 23:58:37,154 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:37,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:37,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:37,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:37,204 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:37,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:37,314 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-20 23:58:37,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:37,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:58:37,317 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:37,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:58:37,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:58:37,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:58:37,332 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-20 23:58:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:37,469 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-20 23:58:37,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:58:37,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-20 23:58:37,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:37,546 INFO L225 Difference]: With dead ends: 41 [2018-01-20 23:58:37,546 INFO L226 Difference]: Without dead ends: 14 [2018-01-20 23:58:37,549 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-20 23:58:37,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-01-20 23:58:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-01-20 23:58:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-01-20 23:58:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2018-01-20 23:58:37,577 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 11 [2018-01-20 23:58:37,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:37,577 INFO L432 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2018-01-20 23:58:37,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:58:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-01-20 23:58:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-20 23:58:37,578 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:37,578 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:58:37,578 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:58:37,579 INFO L82 PathProgramCache]: Analyzing trace with hash 900052320, now seen corresponding path program 1 times [2018-01-20 23:58:37,579 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:37,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:37,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:37,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:37,581 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:37,636 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:58:37,644 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:37,646 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:37,655 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:37,655 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:37,655 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:37,655 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:37,655 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:37,655 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:37,655 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:37,656 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:58:37,656 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-20 23:58:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:58:37,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:37,657 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:58:37,657 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:58:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash 70987, now seen corresponding path program 1 times [2018-01-20 23:58:37,657 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:37,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:37,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:37,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:37,659 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:37,668 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:58:37,669 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:37,671 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:37,671 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:37,671 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:37,671 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:37,672 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:37,672 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:37,672 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:37,672 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:58:37,672 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-20 23:58:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 23:58:37,675 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:37,675 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:58:37,675 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:58:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash -446752331, now seen corresponding path program 1 times [2018-01-20 23:58:37,676 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:37,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:37,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:37,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:37,678 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:37,714 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:58:37,717 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:37,717 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:37,718 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:37,719 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:37,719 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:37,719 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:37,720 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:37,722 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:37,723 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:37,723 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:37,723 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:37,723 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:37,723 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:37,723 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:37,723 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:58:37,723 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-20 23:58:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 23:58:37,726 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:37,726 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] [2018-01-20 23:58:37,726 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:58:37,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1022997667, now seen corresponding path program 1 times [2018-01-20 23:58:37,726 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:37,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:37,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:37,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:37,728 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:37,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:37,802 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-20 23:58:37,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:37,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:58:37,803 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:37,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:58:37,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:58:37,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:58:37,804 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-20 23:58:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:37,850 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-20 23:58:37,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:58:37,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-20 23:58:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:37,851 INFO L225 Difference]: With dead ends: 41 [2018-01-20 23:58:37,852 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:37,852 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-20 23:58:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:37,853 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-20 23:58:37,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:37,853 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:37,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:58:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:37,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:37,856 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:37,856 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:37,856 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:37,856 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:37,856 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:37,857 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:37,857 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:37,857 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-20 23:58:37,857 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-20 23:58:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-20 23:58:37,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:37,860 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-20 23:58:37,860 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 23:58:37,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1744079337, now seen corresponding path program 1 times [2018-01-20 23:58:37,860 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:37,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:37,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:37,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:37,862 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:37,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:37,914 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-20 23:58:37,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:37,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:58:37,914 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:37,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:58:37,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:58:37,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:58:37,915 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-20 23:58:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:37,999 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-20 23:58:38,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:58:38,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-20 23:58:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:38,000 INFO L225 Difference]: With dead ends: 41 [2018-01-20 23:58:38,000 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:38,001 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-20 23:58:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:38,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:38,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-01-20 23:58:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:38,001 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:38,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:58:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:38,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:38,003 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:38,003 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:38,003 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:38,003 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:38,003 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:38,003 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:38,003 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:38,003 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == g5Err0EnsuresViolation======== [2018-01-20 23:58:38,003 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:38,004 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-20 23:58:38,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 23:58:38,005 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:38,005 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-20 23:58:38,005 INFO L371 AbstractCegarLoop]: === Iteration 1 === [g5Err0EnsuresViolation]=== [2018-01-20 23:58:38,005 INFO L82 PathProgramCache]: Analyzing trace with hash -780307178, now seen corresponding path program 1 times [2018-01-20 23:58:38,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:38,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:38,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:38,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:38,007 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:38,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:38,042 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-20 23:58:38,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:38,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:58:38,042 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:38,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:58:38,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:58:38,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:58:38,043 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-20 23:58:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:38,090 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-20 23:58:38,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:58:38,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-20 23:58:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:38,091 INFO L225 Difference]: With dead ends: 41 [2018-01-20 23:58:38,091 INFO L226 Difference]: Without dead ends: 25 [2018-01-20 23:58:38,091 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-20 23:58:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-01-20 23:58:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-01-20 23:58:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-20 23:58:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-01-20 23:58:38,096 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2018-01-20 23:58:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:38,096 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-01-20 23:58:38,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:58:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-01-20 23:58:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 23:58:38,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:38,097 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-20 23:58:38,097 INFO L371 AbstractCegarLoop]: === Iteration 2 === [g5Err0EnsuresViolation]=== [2018-01-20 23:58:38,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1580278232, now seen corresponding path program 1 times [2018-01-20 23:58:38,097 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:38,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:38,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:38,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:38,098 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:38,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:38,188 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-20 23:58:38,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:38,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 23:58:38,189 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:38,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 23:58:38,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 23:58:38,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-20 23:58:38,189 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 7 states. [2018-01-20 23:58:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:38,226 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-01-20 23:58:38,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 23:58:38,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-20 23:58:38,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:38,227 INFO L225 Difference]: With dead ends: 24 [2018-01-20 23:58:38,227 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:38,228 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-20 23:58:38,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:38,229 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-01-20 23:58:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:38,230 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:38,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 23:58:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:38,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:38,231 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:38,231 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:38,231 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:38,231 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:38,232 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:38,232 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:38,232 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:38,232 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f5Err0EnsuresViolation======== [2018-01-20 23:58:38,232 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-20 23:58:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-20 23:58:38,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:38,234 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:58:38,234 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f5Err0EnsuresViolation]=== [2018-01-20 23:58:38,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2134696014, now seen corresponding path program 1 times [2018-01-20 23:58:38,235 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:38,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:38,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:38,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:38,236 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:38,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:38,260 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-20 23:58:38,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:38,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:58:38,261 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:38,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:58:38,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:58:38,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:58:38,262 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-20 23:58:38,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:38,334 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-20 23:58:38,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:58:38,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-20 23:58:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:38,336 INFO L225 Difference]: With dead ends: 41 [2018-01-20 23:58:38,336 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:38,336 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-20 23:58:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:38,337 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-20 23:58:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:38,338 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:38,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:58:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:38,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:38,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:58:38 BoogieIcfgContainer [2018-01-20 23:58:38,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:58:38,342 INFO L168 Benchmark]: Toolchain (without parser) took 1753.22 ms. Allocated memory was 303.0 MB in the beginning and 458.8 MB in the end (delta: 155.7 MB). Free memory was 260.3 MB in the beginning and 349.0 MB in the end (delta: -88.6 MB). Peak memory consumption was 67.1 MB. Max. memory is 5.3 GB. [2018-01-20 23:58:38,343 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:58:38,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.99 ms. Allocated memory is still 303.0 MB. Free memory was 260.3 MB in the beginning and 247.3 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-20 23:58:38,344 INFO L168 Benchmark]: Boogie Preprocessor took 32.47 ms. Allocated memory is still 303.0 MB. Free memory was 247.3 MB in the beginning and 246.3 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-01-20 23:58:38,344 INFO L168 Benchmark]: RCFGBuilder took 217.67 ms. Allocated memory is still 303.0 MB. Free memory was 246.3 MB in the beginning and 231.4 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. [2018-01-20 23:58:38,344 INFO L168 Benchmark]: TraceAbstraction took 1293.57 ms. Allocated memory was 303.0 MB in the beginning and 458.8 MB in the end (delta: 155.7 MB). Free memory was 231.4 MB in the beginning and 349.0 MB in the end (delta: -117.5 MB). Peak memory consumption was 38.2 MB. Max. memory is 5.3 GB. [2018-01-20 23:58:38,345 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 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.99 ms. Allocated memory is still 303.0 MB. Free memory was 260.3 MB in the beginning and 247.3 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.47 ms. Allocated memory is still 303.0 MB. Free memory was 247.3 MB in the beginning and 246.3 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 217.67 ms. Allocated memory is still 303.0 MB. Free memory was 246.3 MB in the beginning and 231.4 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1293.57 ms. Allocated memory was 303.0 MB in the beginning and 458.8 MB in the end (delta: 155.7 MB). Free memory was 231.4 MB in the beginning and 349.0 MB in the end (delta: -117.5 MB). Peak memory consumption was 38.2 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: - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1450] CALL entry_point() [L1445] CALL f5() [L1434] CALL ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={6:0}, size=4] [L1074] return malloc(size); VAL [\old(size)=4, \result={6:0}, malloc(size)={6:0}, size=4] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 7 procedures, 37 locations, 7 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 11 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=37occurred 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: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 7 procedures, 37 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=37occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1450] CALL entry_point() [L1445] CALL, EXPR f5() [L1434] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=4, \result={0:0}, size=4] [L1434] EXPR ldv_malloc(sizeof(int)) VAL [ldv_malloc(sizeof(int))={0:0}] [L1434] int *p = (int *)ldv_malloc(sizeof(int)); [L1435] RET return 0; VAL [\result={0:0}, p={0:0}] [L1445] EXPR f5() VAL [f5()={0:0}] [L1445] int *p = f5(); [L1446] CALL g5(p) VAL [p={0:0}] [L1439] COND FALSE !(\read(*p)) VAL [p={0:0}, p={0:0}] [L1446] FCALL g5(p) - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 37 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=37occurred 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, 26 NumberOfCodeBlocks, 26 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: 1449]: 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, 37 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 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=37occurred 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, 1 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 1403 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, 37 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 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=37occurred 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, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 1113 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: 1438]: 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: g5Err0EnsuresViolation CFG has 7 procedures, 37 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 42 SDtfs, 12 SDslu, 92 SDs, 0 SdLazy, 30 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 1595 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: 1433]: 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: f5Err0EnsuresViolation CFG has 7 procedures, 37 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 9 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=37occurred 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 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test5_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-58-38-355.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test5_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-58-38-355.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test5_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-58-38-355.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test5_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-58-38-355.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test5_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-58-38-355.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test5_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_23-58-38-355.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test5_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_23-58-38-355.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test5_2_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-20_23-58-38-355.csv Received shutdown request...