java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:41:27,511 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:41:27,512 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:41:27,527 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:41:27,528 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:41:27,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:41:27,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:41:27,532 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:41:27,533 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:41:27,534 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:41:27,535 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:41:27,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:41:27,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:41:27,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:41:27,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:41:27,542 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:41:27,544 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:41:27,546 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:41:27,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:41:27,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:41:27,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:41:27,552 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:41:27,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:41:27,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:41:27,554 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:41:27,555 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:41:27,555 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:41:27,556 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:41:27,556 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:41:27,556 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:41:27,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:41:27,558 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-21 10:41:27,568 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:41:27,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:41:27,569 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:41:27,569 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:41:27,569 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:41:27,570 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:41:27,570 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:41:27,570 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:41:27,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:41:27,571 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:41:27,571 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:41:27,571 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:41:27,571 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:41:27,572 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:41:27,572 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:41:27,572 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:41:27,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:41:27,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:41:27,573 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:41:27,573 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:41:27,573 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:41:27,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:41:27,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:41:27,574 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:41:27,574 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:41:27,574 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:41:27,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:41:27,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:41:27,575 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:41:27,575 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:41:27,575 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:41:27,575 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:41:27,575 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:41:27,576 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:41:27,576 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:41:27,576 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:41:27,576 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:41:27,577 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:41:27,577 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:41:27,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:41:27,628 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:41:27,633 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:41:27,634 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:41:27,635 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:41:27,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-21 10:41:27,896 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:41:27,901 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:41:27,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:41:27,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:41:27,910 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:41:27,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:41:27" (1/1) ... [2018-01-21 10:41:27,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b3acea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:27, skipping insertion in model container [2018-01-21 10:41:27,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:41:27" (1/1) ... [2018-01-21 10:41:27,931 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:41:27,981 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:41:28,101 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:41:28,121 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:41:28,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:28 WrapperNode [2018-01-21 10:41:28,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:41:28,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:41:28,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:41:28,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:41:28,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:28" (1/1) ... [2018-01-21 10:41:28,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:28" (1/1) ... [2018-01-21 10:41:28,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:28" (1/1) ... [2018-01-21 10:41:28,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:28" (1/1) ... [2018-01-21 10:41:28,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:28" (1/1) ... [2018-01-21 10:41:28,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:28" (1/1) ... [2018-01-21 10:41:28,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:28" (1/1) ... [2018-01-21 10:41:28,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:41:28,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:41:28,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:41:28,171 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:41:28,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:28" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:41:28,218 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:41:28,218 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:41:28,218 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-01-21 10:41:28,218 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 10:41:28,218 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-21 10:41:28,219 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-21 10:41:28,219 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 10:41:28,219 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:41:28,219 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:41:28,219 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:41:28,219 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:41:28,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:41:28,220 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:41:28,220 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:41:28,220 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:41:28,220 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:41:28,220 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-01-21 10:41:28,220 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 10:41:28,221 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-21 10:41:28,221 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-21 10:41:28,221 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-21 10:41:28,221 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 10:41:28,221 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:41:28,221 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:41:28,222 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:41:28,496 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:41:28,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:41:28 BoogieIcfgContainer [2018-01-21 10:41:28,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:41:28,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:41:28,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:41:28,500 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:41:28,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:41:27" (1/3) ... [2018-01-21 10:41:28,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2e02e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:41:28, skipping insertion in model container [2018-01-21 10:41:28,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:41:28" (2/3) ... [2018-01-21 10:41:28,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2e02e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:41:28, skipping insertion in model container [2018-01-21 10:41:28,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:41:28" (3/3) ... [2018-01-21 10:41:28,503 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-21 10:41:28,512 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:41:28,518 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-01-21 10:41:28,566 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:28,566 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:28,567 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:28,567 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:28,567 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:28,567 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:28,567 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:28,567 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 10:41:28,568 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 10:41:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 10:41:28,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:28,596 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:28,596 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 10:41:28,601 INFO L82 PathProgramCache]: Analyzing trace with hash 643835230, now seen corresponding path program 1 times [2018-01-21 10:41:28,603 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:28,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:28,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:28,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:28,656 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:28,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:28,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:28,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:41:28,781 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:28,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:41:28,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:41:28,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:28,801 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-01-21 10:41:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:29,068 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2018-01-21 10:41:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:41:29,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 10:41:29,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:29,081 INFO L225 Difference]: With dead ends: 136 [2018-01-21 10:41:29,082 INFO L226 Difference]: Without dead ends: 37 [2018-01-21 10:41:29,086 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-21 10:41:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-21 10:41:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-21 10:41:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-01-21 10:41:29,131 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 17 [2018-01-21 10:41:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:29,131 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-01-21 10:41:29,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:41:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-01-21 10:41:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 10:41:29,134 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:29,134 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:29,134 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 10:41:29,134 INFO L82 PathProgramCache]: Analyzing trace with hash 250272672, now seen corresponding path program 1 times [2018-01-21 10:41:29,134 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:29,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:29,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,137 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:29,215 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:41:29,224 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:29,225 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:29,226 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:29,239 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:29,239 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:29,239 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:29,239 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:29,239 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:29,239 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:29,239 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:29,239 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:41:29,239 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 10:41:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:41:29,241 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:29,241 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:41:29,242 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:41:29,242 INFO L82 PathProgramCache]: Analyzing trace with hash 153409, now seen corresponding path program 1 times [2018-01-21 10:41:29,242 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:29,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:29,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,243 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:29,252 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:41:29,253 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:29,256 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:29,256 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:29,256 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:29,256 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:29,256 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:29,257 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:29,257 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:29,257 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_positiveErr0EnsuresViolation======== [2018-01-21 10:41:29,257 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 10:41:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 10:41:29,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:29,260 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:29,260 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_positiveErr0EnsuresViolation]=== [2018-01-21 10:41:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1058941792, now seen corresponding path program 1 times [2018-01-21 10:41:29,261 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:29,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:29,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,263 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:29,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:29,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:29,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-01-21 10:41:29,284 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:29,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:41:29,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:41:29,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:41:29,285 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 2 states. [2018-01-21 10:41:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:29,294 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2018-01-21 10:41:29,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:41:29,294 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-21 10:41:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:29,295 INFO L225 Difference]: With dead ends: 124 [2018-01-21 10:41:29,295 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:41:29,296 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:41:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:41:29,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:41:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:41:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:41:29,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-01-21 10:41:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:29,297 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:41:29,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:41:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:41:29,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:41:29,300 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:29,300 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:29,301 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:29,301 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:29,301 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:29,301 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:29,301 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:29,301 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_17Err0EnsuresViolation======== [2018-01-21 10:41:29,301 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 10:41:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 10:41:29,304 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:29,304 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-21 10:41:29,304 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 10:41:29,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1013801841, now seen corresponding path program 1 times [2018-01-21 10:41:29,305 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:29,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:29,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,306 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:29,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:29,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:29,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:41:29,395 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:29,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:41:29,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:41:29,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:41:29,396 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 5 states. [2018-01-21 10:41:29,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:29,430 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2018-01-21 10:41:29,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:41:29,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-21 10:41:29,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:29,434 INFO L225 Difference]: With dead ends: 136 [2018-01-21 10:41:29,434 INFO L226 Difference]: Without dead ends: 49 [2018-01-21 10:41:29,435 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-21 10:41:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-21 10:41:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-21 10:41:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-21 10:41:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-01-21 10:41:29,444 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 26 [2018-01-21 10:41:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:29,444 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-01-21 10:41:29,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:41:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-01-21 10:41:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 10:41:29,445 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:29,445 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] [2018-01-21 10:41:29,445 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 10:41:29,445 INFO L82 PathProgramCache]: Analyzing trace with hash 763530293, now seen corresponding path program 1 times [2018-01-21 10:41:29,445 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:29,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:29,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,447 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:29,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:29,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:29,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:41:29,501 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:29,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:41:29,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:41:29,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:41:29,502 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-01-21 10:41:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:29,530 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-21 10:41:29,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:41:29,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-21 10:41:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:29,532 INFO L225 Difference]: With dead ends: 56 [2018-01-21 10:41:29,532 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:41:29,533 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:41:29,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:41:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:41:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:41:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:41:29,534 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-01-21 10:41:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:29,534 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:41:29,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:41:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:41:29,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:41:29,536 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:29,536 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:29,537 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:29,537 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:29,537 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:29,537 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:29,537 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:29,537 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:41:29,537 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 10:41:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 10:41:29,540 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:29,540 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:29,540 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:41:29,540 INFO L82 PathProgramCache]: Analyzing trace with hash -116254489, now seen corresponding path program 1 times [2018-01-21 10:41:29,540 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:29,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:29,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,542 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:41:29,571 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:41:29,574 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:29,575 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:29,575 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:29,576 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:29,576 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:29,577 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:41:29,580 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:29,580 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:29,580 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:29,580 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:29,580 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:29,580 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:29,580 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:29,580 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:41:29,580 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 10:41:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 10:41:29,582 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:29,582 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:29,582 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:41:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1215520132, now seen corresponding path program 1 times [2018-01-21 10:41:29,582 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:29,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:29,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,583 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:29,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:29,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:29,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:41:29,630 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:29,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:41:29,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:41:29,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:29,631 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-01-21 10:41:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:29,728 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2018-01-21 10:41:29,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:41:29,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-21 10:41:29,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:29,729 INFO L225 Difference]: With dead ends: 136 [2018-01-21 10:41:29,729 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:41:29,730 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-21 10:41:29,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:41:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:41:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:41:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:41:29,731 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 10:41:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:29,732 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:41:29,732 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:41:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:41:29,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:41:29,734 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:29,734 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:29,734 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:29,734 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:29,734 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:29,734 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:29,735 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:29,735 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_17Err0EnsuresViolation======== [2018-01-21 10:41:29,735 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 10:41:29,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 10:41:29,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:29,738 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-21 10:41:29,738 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_17Err0EnsuresViolation]=== [2018-01-21 10:41:29,739 INFO L82 PathProgramCache]: Analyzing trace with hash -498277862, now seen corresponding path program 1 times [2018-01-21 10:41:29,739 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:29,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:29,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:29,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:29,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:29,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:41:29,819 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:29,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:41:29,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:41:29,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:41:29,820 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 5 states. [2018-01-21 10:41:29,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:29,864 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2018-01-21 10:41:29,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:41:29,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-21 10:41:29,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:29,866 INFO L225 Difference]: With dead ends: 136 [2018-01-21 10:41:29,866 INFO L226 Difference]: Without dead ends: 60 [2018-01-21 10:41:29,866 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-21 10:41:29,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-21 10:41:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-21 10:41:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-21 10:41:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-01-21 10:41:29,872 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 32 [2018-01-21 10:41:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:29,872 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-01-21 10:41:29,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:41:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-01-21 10:41:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 10:41:29,874 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:29,874 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, 1, 1, 1] [2018-01-21 10:41:29,874 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_17Err0EnsuresViolation]=== [2018-01-21 10:41:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1466399899, now seen corresponding path program 1 times [2018-01-21 10:41:29,874 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:29,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:29,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,876 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:29,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:29,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:29,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:41:29,916 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:29,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:41:29,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:41:29,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:41:29,918 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 4 states. [2018-01-21 10:41:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:29,946 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-01-21 10:41:29,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:41:29,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-21 10:41:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:29,947 INFO L225 Difference]: With dead ends: 67 [2018-01-21 10:41:29,948 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:41:29,948 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:41:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:41:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:41:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:41:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:41:29,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-01-21 10:41:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:29,949 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:41:29,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:41:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:41:29,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:41:29,950 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:41:29,950 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:41:29,950 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:41:29,950 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:41:29,950 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:41:29,950 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:41:29,950 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:41:29,950 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 10:41:29,950 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:41:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-21 10:41:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 10:41:29,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:29,952 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:29,952 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 10:41:29,952 INFO L82 PathProgramCache]: Analyzing trace with hash 86180953, now seen corresponding path program 1 times [2018-01-21 10:41:29,952 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:29,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:29,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:29,953 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:29,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:29,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:29,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:41:29,990 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:29,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:41:29,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:41:29,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:29,991 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-01-21 10:41:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:30,057 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2018-01-21 10:41:30,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:41:30,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-21 10:41:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:30,059 INFO L225 Difference]: With dead ends: 136 [2018-01-21 10:41:30,059 INFO L226 Difference]: Without dead ends: 73 [2018-01-21 10:41:30,059 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:41:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-21 10:41:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2018-01-21 10:41:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-21 10:41:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-01-21 10:41:30,068 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2018-01-21 10:41:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:30,068 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-01-21 10:41:30,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:41:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2018-01-21 10:41:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-21 10:41:30,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:30,070 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, 1, 1, 1, 1] [2018-01-21 10:41:30,070 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 10:41:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash -519965000, now seen corresponding path program 1 times [2018-01-21 10:41:30,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:30,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:30,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:30,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:30,073 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:30,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:30,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:30,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:41:30,141 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:30,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:41:30,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:41:30,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:41:30,143 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 5 states. [2018-01-21 10:41:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:30,160 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2018-01-21 10:41:30,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:41:30,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-21 10:41:30,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:30,162 INFO L225 Difference]: With dead ends: 110 [2018-01-21 10:41:30,162 INFO L226 Difference]: Without dead ends: 63 [2018-01-21 10:41:30,163 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-21 10:41:30,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-21 10:41:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-21 10:41:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-21 10:41:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-01-21 10:41:30,170 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 38 [2018-01-21 10:41:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:30,171 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-01-21 10:41:30,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:41:30,171 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-01-21 10:41:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 10:41:30,173 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:41:30,173 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, 1, 1, 1, 1, 1, 1] [2018-01-21 10:41:30,173 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 10:41:30,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1407131062, now seen corresponding path program 1 times [2018-01-21 10:41:30,173 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:41:30,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:30,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:41:30,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:41:30,175 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:41:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:41:30,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:41:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:41:30,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:41:30,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:41:30,227 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:41:30,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:41:30,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:41:30,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:41:30,228 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 4 states. [2018-01-21 10:41:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:41:30,277 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-01-21 10:41:30,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:41:30,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-21 10:41:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:41:30,278 INFO L225 Difference]: With dead ends: 70 [2018-01-21 10:41:30,278 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:41:30,279 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:41:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:41:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:41:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:41:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:41:30,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-01-21 10:41:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:41:30,280 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:41:30,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:41:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:41:30,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:41:30,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:41:30 BoogieIcfgContainer [2018-01-21 10:41:30,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:41:30,282 INFO L168 Benchmark]: Toolchain (without parser) took 2385.89 ms. Allocated memory was 307.8 MB in the beginning and 481.3 MB in the end (delta: 173.5 MB). Free memory was 266.7 MB in the beginning and 424.9 MB in the end (delta: -158.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 5.3 GB. [2018-01-21 10:41:30,283 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 307.8 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:41:30,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.69 ms. Allocated memory is still 307.8 MB. Free memory was 266.7 MB in the beginning and 253.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-01-21 10:41:30,284 INFO L168 Benchmark]: Boogie Preprocessor took 39.57 ms. Allocated memory is still 307.8 MB. Free memory was 253.3 MB in the beginning and 251.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:41:30,284 INFO L168 Benchmark]: RCFGBuilder took 325.93 ms. Allocated memory is still 307.8 MB. Free memory was 251.3 MB in the beginning and 229.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:41:30,284 INFO L168 Benchmark]: TraceAbstraction took 1784.23 ms. Allocated memory was 307.8 MB in the beginning and 481.3 MB in the end (delta: 173.5 MB). Free memory was 229.2 MB in the beginning and 424.9 MB in the end (delta: -195.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:41:30,285 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.22 ms. Allocated memory is still 307.8 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 227.69 ms. Allocated memory is still 307.8 MB. Free memory was 266.7 MB in the beginning and 253.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.57 ms. Allocated memory is still 307.8 MB. Free memory was 253.3 MB in the beginning and 251.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 325.93 ms. Allocated memory is still 307.8 MB. Free memory was 251.3 MB in the beginning and 229.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1784.23 ms. Allocated memory was 307.8 MB in the beginning and 481.3 MB in the end (delta: 173.5 MB). Free memory was 229.2 MB in the beginning and 424.9 MB in the end (delta: -195.7 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) - 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: [L1481] CALL entry_point() [L1466] int i; [L1467] CALL, EXPR ldv_positive() [L1064] int r = __VERIFIER_nondet_int(); [L1065] COND TRUE r>0 [L1065] RET return r; VAL [\result=16777215, r=16777215] [L1467] EXPR ldv_positive() VAL [ldv_positive()=16777215] [L1467] int len = ldv_positive(); [L1469] CALL ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=67108860] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=67108860, malloc(size)={67108862:0}, size=67108860] [L1074] return malloc(size); VAL [\old(size)=67108860, \result={67108862:0}, malloc(size)={67108862:0}, size=67108860] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 8 procedures, 73 locations, 8 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 42 SDslu, 15 SDs, 0 SdLazy, 29 SolverSat, 22 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=73occurred 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, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 352 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 8 procedures, 73 locations, 8 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=73occurred 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: 1063]: 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: ldv_positiveErr0EnsuresViolation CFG has 8 procedures, 73 locations, 8 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 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: 1440]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: alloc_17Err0EnsuresViolation CFG has 8 procedures, 73 locations, 8 error locations. SAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 95 SDtfs, 12 SDslu, 235 SDs, 0 SdLazy, 32 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 2414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1481] CALL entry_point() [L1466] int i; [L1467] CALL, EXPR ldv_positive() [L1064] int r = __VERIFIER_nondet_int(); [L1065] COND TRUE r>0 [L1065] RET return r; VAL [\result=1, r=1] [L1467] EXPR ldv_positive() VAL [ldv_positive()=1] [L1467] int len = ldv_positive(); [L1469] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=4] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=4, \result={0:0}, size=4] [L1469] EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_malloc(sizeof(struct A17*)*len)={0:0}, len=1] [L1469] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1470] COND FALSE, RET !(\read(**array)) VAL [array={0:0}, len=1] [L1481] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 8 procedures, 73 locations, 8 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=73occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1480]: 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 8 procedures, 73 locations, 8 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 36 SDslu, 15 SDs, 0 SdLazy, 29 SolverSat, 18 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=73occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 1100 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: 1458]: 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 8 procedures, 73 locations, 8 error locations. SAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 95 SDtfs, 12 SDslu, 235 SDs, 0 SdLazy, 32 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 3433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1465]: 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 8 procedures, 73 locations, 8 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 45 SDslu, 217 SDs, 0 SdLazy, 58 SolverSat, 25 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=73occurred 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, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 5086 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_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-41-30-297.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-41-30-297.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-41-30-297.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-41-30-297.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_10-41-30-297.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_10-41-30-297.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_10-41-30-297.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_10-41-30-297.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_10-41-30-297.csv Received shutdown request...