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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:22:07,557 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:22:07,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:22:07,574 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:22:07,574 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:22:07,575 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:22:07,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:22:07,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:22:07,580 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:22:07,581 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:22:07,582 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:22:07,582 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:22:07,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:22:07,584 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:22:07,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:22:07,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:22:07,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:22:07,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:22:07,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:22:07,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:22:07,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:22:07,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:22:07,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:22:07,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:22:07,600 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:22:07,601 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:22:07,601 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:22:07,602 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:22:07,602 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:22:07,602 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:22:07,603 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:22:07,603 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:22:07,612 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:22:07,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:22:07,613 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:22:07,613 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:22:07,613 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:22:07,613 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:22:07,613 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:22:07,614 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:22:07,614 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:22:07,614 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:22:07,614 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:22:07,614 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:22:07,614 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:22:07,615 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:22:07,615 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:22:07,615 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:22:07,615 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:22:07,615 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:22:07,615 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:22:07,615 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:22:07,616 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:22:07,616 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:22:07,616 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:22:07,616 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:22:07,616 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:22:07,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:22:07,617 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:22:07,617 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:22:07,617 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:22:07,617 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:22:07,617 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:22:07,617 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:22:07,617 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:22:07,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:22:07,618 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:22:07,618 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:22:07,618 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:22:07,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:22:07,663 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:22:07,666 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:22:07,667 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:22:07,667 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:22:07,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-20 22:22:07,870 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:22:07,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:22:07,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:22:07,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:22:07,882 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:22:07,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:22:07" (1/1) ... [2018-01-20 22:22:07,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d422d10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:07, skipping insertion in model container [2018-01-20 22:22:07,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:22:07" (1/1) ... [2018-01-20 22:22:07,901 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:22:07,950 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:22:08,073 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:22:08,095 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:22:08,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:08 WrapperNode [2018-01-20 22:22:08,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:22:08,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:22:08,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:22:08,106 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:22:08,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:08" (1/1) ... [2018-01-20 22:22:08,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:08" (1/1) ... [2018-01-20 22:22:08,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:08" (1/1) ... [2018-01-20 22:22:08,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:08" (1/1) ... [2018-01-20 22:22:08,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:08" (1/1) ... [2018-01-20 22:22:08,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:08" (1/1) ... [2018-01-20 22:22:08,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:08" (1/1) ... [2018-01-20 22:22:08,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:22:08,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:22:08,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:22:08,151 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:22:08,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:08" (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 22:22:08,201 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:22:08,202 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:22:08,202 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-20 22:22:08,202 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-20 22:22:08,202 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-20 22:22:08,202 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-20 22:22:08,203 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:22:08,203 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:22:08,203 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:22:08,203 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:22:08,203 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:22:08,203 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:22:08,204 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:22:08,204 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:22:08,204 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:22:08,204 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-20 22:22:08,204 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-20 22:22:08,204 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-20 22:22:08,205 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-20 22:22:08,205 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:22:08,205 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:22:08,205 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:22:08,471 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:22:08,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:22:08 BoogieIcfgContainer [2018-01-20 22:22:08,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:22:08,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:22:08,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:22:08,474 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:22:08,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:22:07" (1/3) ... [2018-01-20 22:22:08,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700156b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:22:08, skipping insertion in model container [2018-01-20 22:22:08,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:22:08" (2/3) ... [2018-01-20 22:22:08,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700156b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:22:08, skipping insertion in model container [2018-01-20 22:22:08,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:22:08" (3/3) ... [2018-01-20 22:22:08,478 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-20 22:22:08,489 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:22:08,497 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-20 22:22:08,541 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:08,542 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:08,542 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:08,542 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:08,542 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:08,542 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:08,543 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:08,543 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-20 22:22:08,544 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:22:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-20 22:22:08,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:08,571 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:08,571 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 22:22:08,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1267872988, now seen corresponding path program 1 times [2018-01-20 22:22:08,579 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:08,579 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:08,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:08,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:08,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:08,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:08,748 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 22:22:08,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:08,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:22:08,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:22:08,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:22:08,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:22:08,766 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-20 22:22:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,023 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2018-01-20 22:22:09,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:22:09,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-20 22:22:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,033 INFO L225 Difference]: With dead ends: 129 [2018-01-20 22:22:09,033 INFO L226 Difference]: Without dead ends: 31 [2018-01-20 22:22:09,036 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 22:22:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-20 22:22:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-20 22:22:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-20 22:22:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-20 22:22:09,073 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-01-20 22:22:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,073 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-20 22:22:09,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:22:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-20 22:22:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-20 22:22:09,075 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,075 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:09,075 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 22:22:09,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1344677638, now seen corresponding path program 1 times [2018-01-20 22:22:09,076 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:22:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:22:09,146 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:22:09,154 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,155 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,166 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:09,166 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:09,166 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:09,166 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:09,167 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:09,167 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:09,167 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:09,167 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:22:09,167 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:22:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:22:09,170 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,170 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:22:09,170 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:22:09,170 INFO L82 PathProgramCache]: Analyzing trace with hash 144536, now seen corresponding path program 1 times [2018-01-20 22:22:09,171 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:22:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:22:09,182 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:22:09,183 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,186 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:09,186 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:09,186 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:09,186 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:09,187 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:09,187 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:09,187 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:09,187 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_17Err0EnsuresViolation======== [2018-01-20 22:22:09,187 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:22:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 22:22:09,191 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,191 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 22:22:09,191 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err0EnsuresViolation]=== [2018-01-20 22:22:09,191 INFO L82 PathProgramCache]: Analyzing trace with hash 149863804, now seen corresponding path program 1 times [2018-01-20 22:22:09,192 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:09,228 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 22:22:09,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:09,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:22:09,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:22:09,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:22:09,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:22:09,230 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-01-20 22:22:09,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,239 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2018-01-20 22:22:09,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:22:09,239 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-20 22:22:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,240 INFO L225 Difference]: With dead ends: 117 [2018-01-20 22:22:09,240 INFO L226 Difference]: Without dead ends: 41 [2018-01-20 22:22:09,241 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:22:09,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-20 22:22:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-20 22:22:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-20 22:22:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-20 22:22:09,248 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2018-01-20 22:22:09,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,251 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-20 22:22:09,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:22:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-20 22:22:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-20 22:22:09,252 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,252 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 22:22:09,252 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err0EnsuresViolation]=== [2018-01-20 22:22:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1790905482, now seen corresponding path program 1 times [2018-01-20 22:22:09,253 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,253 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:09,348 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 22:22:09,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:09,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:22:09,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:09,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:09,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:09,349 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-20 22:22:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,366 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-01-20 22:22:09,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:22:09,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-20 22:22:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,369 INFO L225 Difference]: With dead ends: 76 [2018-01-20 22:22:09,369 INFO L226 Difference]: Without dead ends: 43 [2018-01-20 22:22:09,370 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-20 22:22:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-20 22:22:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 22:22:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-20 22:22:09,375 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 22 [2018-01-20 22:22:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,375 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-20 22:22:09,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-20 22:22:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 22:22:09,376 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,376 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 22:22:09,376 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err0EnsuresViolation]=== [2018-01-20 22:22:09,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1130115224, now seen corresponding path program 1 times [2018-01-20 22:22:09,376 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,377 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:09,427 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 22:22:09,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:09,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:22:09,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:22:09,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:22:09,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:22:09,429 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-20 22:22:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,466 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-20 22:22:09,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:22:09,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-20 22:22:09,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,468 INFO L225 Difference]: With dead ends: 50 [2018-01-20 22:22:09,468 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:09,468 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-20 22:22:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:09,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-20 22:22:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,469 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:09,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:22:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:09,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:09,473 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:09,473 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:09,473 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:09,473 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:09,474 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:09,474 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:09,474 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:09,474 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:22:09,474 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:22:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 22:22:09,477 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,477 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-20 22:22:09,477 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:22:09,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1879772685, now seen corresponding path program 1 times [2018-01-20 22:22:09,477 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:22:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:22:09,503 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:22:09,505 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,506 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,507 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,507 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,507 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:22:09,511 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:09,511 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:09,511 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:09,511 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:09,512 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:09,512 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:09,512 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:09,512 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:22:09,512 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:22:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-20 22:22:09,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,515 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:09,515 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:22:09,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1816479186, now seen corresponding path program 1 times [2018-01-20 22:22:09,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:09,551 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 22:22:09,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:09,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:22:09,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:22:09,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:22:09,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:22:09,552 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-20 22:22:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,642 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2018-01-20 22:22:09,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:22:09,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-20 22:22:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,642 INFO L225 Difference]: With dead ends: 129 [2018-01-20 22:22:09,642 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:09,643 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 22:22:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:09,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-20 22:22:09,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,644 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:09,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:22:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:09,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:09,646 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:09,647 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:09,647 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:09,647 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:09,647 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:09,647 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:09,647 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:09,647 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_17Err0EnsuresViolation======== [2018-01-20 22:22:09,647 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:22:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 22:22:09,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,650 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 22:22:09,650 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_17Err0EnsuresViolation]=== [2018-01-20 22:22:09,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1609342893, now seen corresponding path program 1 times [2018-01-20 22:22:09,651 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,651 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:09,674 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 22:22:09,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:09,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:22:09,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:22:09,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:22:09,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:22:09,675 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-01-20 22:22:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,681 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2018-01-20 22:22:09,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:22:09,681 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-20 22:22:09,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,683 INFO L225 Difference]: With dead ends: 117 [2018-01-20 22:22:09,683 INFO L226 Difference]: Without dead ends: 52 [2018-01-20 22:22:09,684 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:22:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-20 22:22:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-20 22:22:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-20 22:22:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-01-20 22:22:09,690 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 26 [2018-01-20 22:22:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,691 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-01-20 22:22:09,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:22:09,691 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-01-20 22:22:09,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 22:22:09,692 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,692 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:09,692 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_17Err0EnsuresViolation]=== [2018-01-20 22:22:09,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1124045575, now seen corresponding path program 1 times [2018-01-20 22:22:09,693 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:09,773 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 22:22:09,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:09,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:22:09,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:09,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:09,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:09,774 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 5 states. [2018-01-20 22:22:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,786 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-01-20 22:22:09,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:22:09,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-20 22:22:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,788 INFO L225 Difference]: With dead ends: 98 [2018-01-20 22:22:09,789 INFO L226 Difference]: Without dead ends: 54 [2018-01-20 22:22:09,789 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:09,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-20 22:22:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-20 22:22:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-20 22:22:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-20 22:22:09,794 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 29 [2018-01-20 22:22:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,794 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-20 22:22:09,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-20 22:22:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-20 22:22:09,796 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,796 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:09,796 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_17Err0EnsuresViolation]=== [2018-01-20 22:22:09,796 INFO L82 PathProgramCache]: Analyzing trace with hash -69053349, now seen corresponding path program 1 times [2018-01-20 22:22:09,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:09,838 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 22:22:09,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:09,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:22:09,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:22:09,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:22:09,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:22:09,839 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 4 states. [2018-01-20 22:22:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,865 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-20 22:22:09,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:22:09,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-01-20 22:22:09,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,866 INFO L225 Difference]: With dead ends: 61 [2018-01-20 22:22:09,866 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:09,866 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-20 22:22:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:09,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:09,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:09,867 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-01-20 22:22:09,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,868 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:09,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:22:09,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:09,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:09,870 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:22:09,870 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:22:09,870 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:22:09,870 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:22:09,870 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:22:09,870 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:22:09,870 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:22:09,870 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-20 22:22:09,870 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:22:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 22:22:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 22:22:09,872 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,872 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:09,872 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 22:22:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash -457755615, now seen corresponding path program 1 times [2018-01-20 22:22:09,873 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,873 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:09,903 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 22:22:09,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:09,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:22:09,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:22:09,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:22:09,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:22:09,904 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 3 states. [2018-01-20 22:22:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:09,965 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2018-01-20 22:22:09,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:22:09,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-20 22:22:09,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:09,967 INFO L225 Difference]: With dead ends: 129 [2018-01-20 22:22:09,967 INFO L226 Difference]: Without dead ends: 67 [2018-01-20 22:22:09,968 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 22:22:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-20 22:22:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-01-20 22:22:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-20 22:22:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-20 22:22:09,974 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 15 [2018-01-20 22:22:09,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:09,975 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-20 22:22:09,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:22:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-20 22:22:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 22:22:09,976 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:09,976 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:09,976 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 22:22:09,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1418378797, now seen corresponding path program 1 times [2018-01-20 22:22:09,977 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:09,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:09,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:09,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:09,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:10,089 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 22:22:10,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:10,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:22:10,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:22:10,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:22:10,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:10,091 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-01-20 22:22:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:10,106 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2018-01-20 22:22:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:22:10,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-20 22:22:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:10,108 INFO L225 Difference]: With dead ends: 104 [2018-01-20 22:22:10,108 INFO L226 Difference]: Without dead ends: 57 [2018-01-20 22:22:10,108 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:22:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-20 22:22:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-20 22:22:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-20 22:22:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-01-20 22:22:10,115 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 32 [2018-01-20 22:22:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:10,115 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-01-20 22:22:10,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:22:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-01-20 22:22:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 22:22:10,117 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:22:10,117 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:22:10,117 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 22:22:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash 121111435, now seen corresponding path program 1 times [2018-01-20 22:22:10,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:22:10,117 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:22:10,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:10,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:22:10,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:22:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:22:10,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:22:10,154 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 22:22:10,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:22:10,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:22:10,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:22:10,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:22:10,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:22:10,156 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 4 states. [2018-01-20 22:22:10,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:22:10,178 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-01-20 22:22:10,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:22:10,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-20 22:22:10,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:22:10,179 INFO L225 Difference]: With dead ends: 64 [2018-01-20 22:22:10,180 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:22:10,180 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-20 22:22:10,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:22:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:22:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:22:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:22:10,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-01-20 22:22:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:22:10,182 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:22:10,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:22:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:22:10,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:22:10,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:22:10 BoogieIcfgContainer [2018-01-20 22:22:10,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:22:10,186 INFO L168 Benchmark]: Toolchain (without parser) took 2315.23 ms. Allocated memory was 305.7 MB in the beginning and 481.3 MB in the end (delta: 175.6 MB). Free memory was 264.6 MB in the beginning and 438.8 MB in the end (delta: -174.2 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-01-20 22:22:10,188 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.7 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:22:10,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.99 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 250.5 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-20 22:22:10,189 INFO L168 Benchmark]: Boogie Preprocessor took 45.17 ms. Allocated memory is still 305.7 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:22:10,189 INFO L168 Benchmark]: RCFGBuilder took 320.68 ms. Allocated memory is still 305.7 MB. Free memory was 248.5 MB in the beginning and 227.5 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-01-20 22:22:10,189 INFO L168 Benchmark]: TraceAbstraction took 1713.22 ms. Allocated memory was 305.7 MB in the beginning and 481.3 MB in the end (delta: 175.6 MB). Free memory was 227.5 MB in the beginning and 438.8 MB in the end (delta: -211.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:22:10,191 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.18 ms. Allocated memory is still 305.7 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.99 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 250.5 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.17 ms. Allocated memory is still 305.7 MB. Free memory was 250.5 MB in the beginning and 248.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 320.68 ms. Allocated memory is still 305.7 MB. Free memory was 248.5 MB in the beginning and 227.5 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1713.22 ms. Allocated memory was 305.7 MB in the beginning and 481.3 MB in the end (delta: 175.6 MB). Free memory was 227.5 MB in the beginning and 438.8 MB in the end (delta: -211.3 MB). There was no memory consumed. 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) * 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: [L1479] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 37 SDslu, 15 SDs, 0 SdLazy, 28 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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=66occurred 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, 66 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=66occurred 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: 1439]: 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_17Err0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 3 SDslu, 136 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 2111 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: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1479] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=40, \result={0:0}, size=40] [L1467] EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_malloc(sizeof(struct A17*)*len)={0:0}, len=10] [L1467] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1468] COND FALSE, RET !(\read(**array)) VAL [array={0:0}, len=10] [L1479] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 66 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=66occurred 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, 19 NumberOfCodeBlocks, 19 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: 1478]: 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, 66 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 32 SDslu, 15 SDs, 0 SdLazy, 28 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 640 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: 1457]: 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_17Err0EnsuresViolation CFG has 7 procedures, 66 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 141 SDtfs, 3 SDslu, 172 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 3341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1464]: 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, 66 locations, 7 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 36 SDslu, 195 SDs, 0 SdLazy, 50 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 3638 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 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-22-10-202.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-22-10-202.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-22-10-202.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-22-10-202.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_22-22-10-202.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_22-22-10-202.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_22-22-10-202.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-20_22-22-10-202.csv Received shutdown request...