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_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 06:12:05,316 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 06:12:05,319 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 06:12:05,333 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 06:12:05,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 06:12:05,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 06:12:05,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 06:12:05,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 06:12:05,340 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 06:12:05,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 06:12:05,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 06:12:05,342 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 06:12:05,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 06:12:05,344 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 06:12:05,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 06:12:05,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 06:12:05,350 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 06:12:05,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 06:12:05,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 06:12:05,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 06:12:05,356 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 06:12:05,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 06:12:05,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 06:12:05,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 06:12:05,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 06:12:05,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 06:12:05,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 06:12:05,361 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 06:12:05,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 06:12:05,361 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 06:12:05,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 06:12:05,362 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_precise.epf [2018-01-21 06:12:05,370 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 06:12:05,371 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 06:12:05,372 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 06:12:05,372 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 06:12:05,372 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 06:12:05,372 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 06:12:05,372 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 06:12:05,372 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 06:12:05,373 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 06:12:05,373 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 06:12:05,373 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 06:12:05,373 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 06:12:05,373 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 06:12:05,373 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 06:12:05,373 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 06:12:05,374 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 06:12:05,374 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 06:12:05,374 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 06:12:05,374 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 06:12:05,374 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 06:12:05,374 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 06:12:05,374 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 06:12:05,375 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 06:12:05,375 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 06:12:05,375 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 06:12:05,375 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 06:12:05,375 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 06:12:05,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 06:12:05,376 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 06:12:05,376 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 06:12:05,376 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 06:12:05,376 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 06:12:05,376 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 06:12:05,376 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 06:12:05,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 06:12:05,376 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 06:12:05,377 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 06:12:05,377 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 06:12:05,377 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 06:12:05,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 06:12:05,421 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 06:12:05,425 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 06:12:05,426 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 06:12:05,426 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 06:12:05,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2018-01-21 06:12:05,620 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 06:12:05,624 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 06:12:05,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 06:12:05,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 06:12:05,630 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 06:12:05,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 06:12:05" (1/1) ... [2018-01-21 06:12:05,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba505b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:05, skipping insertion in model container [2018-01-21 06:12:05,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 06:12:05" (1/1) ... [2018-01-21 06:12:05,647 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 06:12:05,695 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 06:12:05,816 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 06:12:05,838 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 06:12:05,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:05 WrapperNode [2018-01-21 06:12:05,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 06:12:05,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 06:12:05,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 06:12:05,849 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 06:12:05,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:05" (1/1) ... [2018-01-21 06:12:05,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:05" (1/1) ... [2018-01-21 06:12:05,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:05" (1/1) ... [2018-01-21 06:12:05,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:05" (1/1) ... [2018-01-21 06:12:05,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:05" (1/1) ... [2018-01-21 06:12:05,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:05" (1/1) ... [2018-01-21 06:12:05,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:05" (1/1) ... [2018-01-21 06:12:05,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 06:12:05,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 06:12:05,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 06:12:05,889 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 06:12:05,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:05" (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 06:12:05,950 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 06:12:05,950 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 06:12:05,951 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 06:12:05,951 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-21 06:12:05,951 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-21 06:12:05,951 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 06:12:05,951 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 06:12:05,951 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 06:12:05,951 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 06:12:05,952 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 06:12:05,952 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 06:12:05,952 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 06:12:05,952 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 06:12:05,952 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 06:12:05,952 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 06:12:05,953 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 06:12:05,953 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-21 06:12:05,953 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-21 06:12:05,953 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 06:12:05,953 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 06:12:05,953 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 06:12:05,953 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 06:12:06,230 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 06:12:06,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 06:12:06 BoogieIcfgContainer [2018-01-21 06:12:06,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 06:12:06,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 06:12:06,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 06:12:06,233 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 06:12:06,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 06:12:05" (1/3) ... [2018-01-21 06:12:06,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181f96d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 06:12:06, skipping insertion in model container [2018-01-21 06:12:06,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:12:05" (2/3) ... [2018-01-21 06:12:06,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181f96d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 06:12:06, skipping insertion in model container [2018-01-21 06:12:06,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 06:12:06" (3/3) ... [2018-01-21 06:12:06,237 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-01-21 06:12:06,247 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 06:12:06,255 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-21 06:12:06,303 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:06,303 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:06,304 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:06,304 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:06,304 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:06,304 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:06,304 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:06,304 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 06:12:06,305 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 06:12:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 06:12:06,324 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:06,325 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:06,325 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 06:12:06,329 INFO L82 PathProgramCache]: Analyzing trace with hash 441029511, now seen corresponding path program 1 times [2018-01-21 06:12:06,331 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:06,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:06,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:06,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:06,379 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:06,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:06,477 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 06:12:06,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:06,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:12:06,481 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:06,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 06:12:06,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 06:12:06,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:12:06,501 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 06:12:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:06,740 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-21 06:12:06,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 06:12:06,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 06:12:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:06,750 INFO L225 Difference]: With dead ends: 125 [2018-01-21 06:12:06,750 INFO L226 Difference]: Without dead ends: 31 [2018-01-21 06:12:06,754 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 06:12:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-21 06:12:06,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-21 06:12:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 06:12:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-21 06:12:06,790 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-01-21 06:12:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:06,790 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-21 06:12:06,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 06:12:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-21 06:12:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 06:12:06,793 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:06,793 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:06,793 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 06:12:06,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1372495191, now seen corresponding path program 1 times [2018-01-21 06:12:06,794 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:06,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:06,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:06,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:06,796 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:12:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:12:06,862 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 06:12:06,872 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:06,874 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:06,885 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:06,885 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:06,885 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:06,885 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:06,885 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:06,886 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:06,886 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:06,886 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 06:12:06,886 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 06:12:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 06:12:06,889 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:06,889 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 06:12:06,889 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 06:12:06,889 INFO L82 PathProgramCache]: Analyzing trace with hash 141653, now seen corresponding path program 1 times [2018-01-21 06:12:06,889 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:06,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:06,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:06,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:06,891 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:12:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:12:06,901 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 06:12:06,902 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:06,904 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:06,904 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:06,905 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:06,905 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:06,905 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:06,905 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:06,905 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:06,905 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_17Err0EnsuresViolation======== [2018-01-21 06:12:06,905 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 06:12:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 06:12:06,909 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:06,909 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:06,909 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 06:12:06,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1541289171, now seen corresponding path program 1 times [2018-01-21 06:12:06,910 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:06,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:06,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:06,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:06,912 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:06,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:06,946 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 06:12:06,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:06,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:12:06,947 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:06,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 06:12:06,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 06:12:06,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 06:12:06,948 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-21 06:12:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:06,957 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2018-01-21 06:12:06,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 06:12:06,957 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 06:12:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:06,958 INFO L225 Difference]: With dead ends: 115 [2018-01-21 06:12:06,958 INFO L226 Difference]: Without dead ends: 41 [2018-01-21 06:12:06,959 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 06:12:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-21 06:12:06,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-21 06:12:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 06:12:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-21 06:12:06,966 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2018-01-21 06:12:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:06,968 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-21 06:12:06,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 06:12:06,968 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-21 06:12:06,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 06:12:06,969 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:06,969 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:06,969 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 06:12:06,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1909953208, now seen corresponding path program 1 times [2018-01-21 06:12:06,969 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:06,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:06,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:06,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:06,971 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:06,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:07,067 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 06:12:07,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:07,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 06:12:07,067 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:07,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 06:12:07,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 06:12:07,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:12:07,070 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-21 06:12:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:07,084 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-01-21 06:12:07,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 06:12:07,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-21 06:12:07,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:07,088 INFO L225 Difference]: With dead ends: 76 [2018-01-21 06:12:07,088 INFO L226 Difference]: Without dead ends: 43 [2018-01-21 06:12:07,089 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 06:12:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-21 06:12:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-21 06:12:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 06:12:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 06:12:07,095 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 22 [2018-01-21 06:12:07,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:07,095 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 06:12:07,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 06:12:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 06:12:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 06:12:07,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:07,096 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:07,097 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 06:12:07,097 INFO L82 PathProgramCache]: Analyzing trace with hash -30329626, now seen corresponding path program 1 times [2018-01-21 06:12:07,097 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:07,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:07,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,099 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:07,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:07,153 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 06:12:07,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:07,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 06:12:07,154 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:07,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 06:12:07,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 06:12:07,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:12:07,154 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 06:12:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:07,176 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-21 06:12:07,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 06:12:07,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-21 06:12:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:07,177 INFO L225 Difference]: With dead ends: 50 [2018-01-21 06:12:07,178 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:12:07,178 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:12:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:12:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:12:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:12:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:12:07,179 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-21 06:12:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:07,179 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:12:07,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 06:12:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:12:07,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:12:07,183 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:07,183 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:07,183 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:07,183 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:07,183 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:07,184 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:07,184 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:07,184 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 06:12:07,184 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 06:12:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 06:12:07,187 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:07,187 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 06:12:07,187 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 06:12:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1549449137, now seen corresponding path program 1 times [2018-01-21 06:12:07,187 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:07,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,189 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:07,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,189 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:12:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:12:07,214 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 06:12:07,216 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:07,216 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:07,217 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:07,217 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:07,217 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:12:07,220 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:07,220 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:07,221 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:07,221 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:07,221 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:07,221 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:07,221 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:07,221 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 06:12:07,221 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 06:12:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 06:12:07,224 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:07,224 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 06:12:07,224 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 06:12:07,224 INFO L82 PathProgramCache]: Analyzing trace with hash 931220233, now seen corresponding path program 1 times [2018-01-21 06:12:07,224 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:07,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:07,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,226 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:07,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:07,263 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 06:12:07,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:07,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:12:07,263 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:07,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 06:12:07,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 06:12:07,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:12:07,264 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 06:12:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:07,325 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-21 06:12:07,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 06:12:07,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 06:12:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:07,326 INFO L225 Difference]: With dead ends: 125 [2018-01-21 06:12:07,326 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:12:07,327 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 06:12:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:12:07,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:12:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:12:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:12:07,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-21 06:12:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:07,328 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:12:07,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 06:12:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:12:07,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:12:07,330 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:07,330 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:07,330 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:07,331 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:07,331 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:07,331 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:07,331 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:07,331 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_17Err0EnsuresViolation======== [2018-01-21 06:12:07,331 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 06:12:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 06:12:07,334 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:07,334 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 06:12:07,334 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_17Err0EnsuresViolation]=== [2018-01-21 06:12:07,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2119379531, now seen corresponding path program 1 times [2018-01-21 06:12:07,334 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:07,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:07,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,336 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:07,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:07,358 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 06:12:07,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:07,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:12:07,359 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:07,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 06:12:07,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 06:12:07,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 06:12:07,360 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-21 06:12:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:07,364 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2018-01-21 06:12:07,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 06:12:07,364 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-21 06:12:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:07,366 INFO L225 Difference]: With dead ends: 115 [2018-01-21 06:12:07,366 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 06:12:07,367 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 06:12:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 06:12:07,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-21 06:12:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-21 06:12:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-01-21 06:12:07,373 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 26 [2018-01-21 06:12:07,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:07,373 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-01-21 06:12:07,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 06:12:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-01-21 06:12:07,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 06:12:07,375 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:07,375 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:07,375 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_17Err0EnsuresViolation]=== [2018-01-21 06:12:07,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1908262188, now seen corresponding path program 1 times [2018-01-21 06:12:07,376 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:07,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:07,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,377 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:07,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:07,430 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 06:12:07,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:07,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 06:12:07,430 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:07,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 06:12:07,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 06:12:07,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:12:07,431 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 5 states. [2018-01-21 06:12:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:07,445 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-01-21 06:12:07,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 06:12:07,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-21 06:12:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:07,447 INFO L225 Difference]: With dead ends: 98 [2018-01-21 06:12:07,447 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 06:12:07,447 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 06:12:07,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 06:12:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 06:12:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 06:12:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-21 06:12:07,452 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 29 [2018-01-21 06:12:07,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:07,453 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-21 06:12:07,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 06:12:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-21 06:12:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 06:12:07,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:07,454 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:07,454 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_17Err0EnsuresViolation]=== [2018-01-21 06:12:07,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1407892106, now seen corresponding path program 1 times [2018-01-21 06:12:07,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:07,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:07,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,456 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:07,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:07,493 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 06:12:07,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:07,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 06:12:07,493 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:07,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 06:12:07,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 06:12:07,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:12:07,494 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 4 states. [2018-01-21 06:12:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:07,534 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-21 06:12:07,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 06:12:07,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-01-21 06:12:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:07,534 INFO L225 Difference]: With dead ends: 61 [2018-01-21 06:12:07,535 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:12:07,535 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 06:12:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:12:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:12:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:12:07,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:12:07,536 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-01-21 06:12:07,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:07,536 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:12:07,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 06:12:07,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:12:07,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:12:07,537 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:12:07,537 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:12:07,538 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:12:07,538 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:12:07,538 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:12:07,538 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:12:07,538 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:12:07,538 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 06:12:07,538 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:12:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 06:12:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 06:12:07,540 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:12:07,540 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:12:07,540 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 06:12:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash -320818343, now seen corresponding path program 1 times [2018-01-21 06:12:07,541 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:12:07,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:12:07,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:12:07,542 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:12:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:12:07,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:12:07,562 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 06:12:07,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:12:07,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:12:07,562 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:12:07,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 06:12:07,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 06:12:07,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:12:07,563 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 06:12:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:12:07,613 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-21 06:12:07,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 06:12:07,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-21 06:12:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:12:07,614 INFO L225 Difference]: With dead ends: 125 [2018-01-21 06:12:07,614 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:12:07,615 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 06:12:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:12:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:12:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:12:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:12:07,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-01-21 06:12:07,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:12:07,615 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:12:07,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 06:12:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:12:07,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:12:07,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 06:12:07 BoogieIcfgContainer [2018-01-21 06:12:07,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 06:12:07,618 INFO L168 Benchmark]: Toolchain (without parser) took 1997.77 ms. Allocated memory was 302.0 MB in the beginning and 464.0 MB in the end (delta: 162.0 MB). Free memory was 259.2 MB in the beginning and 327.0 MB in the end (delta: -67.8 MB). Peak memory consumption was 94.2 MB. Max. memory is 5.3 GB. [2018-01-21 06:12:07,619 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 302.0 MB. Free memory is still 266.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 06:12:07,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.11 ms. Allocated memory is still 302.0 MB. Free memory was 259.2 MB in the beginning and 245.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-01-21 06:12:07,620 INFO L168 Benchmark]: Boogie Preprocessor took 39.51 ms. Allocated memory is still 302.0 MB. Free memory was 245.9 MB in the beginning and 243.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 06:12:07,620 INFO L168 Benchmark]: RCFGBuilder took 342.19 ms. Allocated memory is still 302.0 MB. Free memory was 243.8 MB in the beginning and 222.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-21 06:12:07,620 INFO L168 Benchmark]: TraceAbstraction took 1386.21 ms. Allocated memory was 302.0 MB in the beginning and 464.0 MB in the end (delta: 162.0 MB). Free memory was 222.8 MB in the beginning and 327.0 MB in the end (delta: -104.1 MB). Peak memory consumption was 57.9 MB. Max. memory is 5.3 GB. [2018-01-21 06:12:07,621 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.13 ms. Allocated memory is still 302.0 MB. Free memory is still 266.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.11 ms. Allocated memory is still 302.0 MB. Free memory was 259.2 MB in the beginning and 245.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.51 ms. Allocated memory is still 302.0 MB. Free memory was 245.9 MB in the beginning and 243.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 342.19 ms. Allocated memory is still 302.0 MB. Free memory was 243.8 MB in the beginning and 222.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1386.21 ms. Allocated memory was 302.0 MB in the beginning and 464.0 MB in the end (delta: 162.0 MB). Free memory was 222.8 MB in the beginning and 327.0 MB in the end (delta: -104.1 MB). Peak memory consumption was 57.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * 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: [L1478] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 7 procedures, 65 locations, 7 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 37 SDslu, 15 SDs, 0 SdLazy, 25 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 7 procedures, 65 locations, 7 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1439]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: alloc_17Err0EnsuresViolation CFG has 7 procedures, 65 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 3 SDslu, 136 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 2111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1478] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=40, \result={0:0}, size=40] [L1467] EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_malloc(sizeof(struct A17*)*len)={0:0}, len=10] [L1467] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1468] COND TRUE, RET !array VAL [array={0:0}, len=10] [L1478] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 65 locations, 7 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1477]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 7 procedures, 65 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 32 SDslu, 15 SDs, 0 SdLazy, 25 SolverSat, 16 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1457]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: free_17Err0EnsuresViolation CFG has 7 procedures, 65 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 140 SDtfs, 3 SDslu, 172 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 3341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1464]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: entry_pointErr0EnsuresViolation CFG has 7 procedures, 65 locations, 7 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 33 SDslu, 15 SDs, 0 SdLazy, 25 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_06-12-07-630.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_06-12-07-630.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_06-12-07-630.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_06-12-07-630.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_06-12-07-630.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_06-12-07-630.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_06-12-07-630.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_06-12-07-630.csv Received shutdown request...