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_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:56:37,512 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:56:37,513 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:56:37,528 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:56:37,528 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:56:37,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:56:37,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:56:37,532 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:56:37,534 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:56:37,535 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:56:37,536 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:56:37,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:56:37,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:56:37,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:56:37,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:56:37,542 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:56:37,544 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:56:37,546 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:56:37,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:56:37,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:56:37,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:56:37,552 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:56:37,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:56:37,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:56:37,554 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:56:37,556 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:56:37,556 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:56:37,557 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:56:37,557 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:56:37,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:56:37,558 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:56:37,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_imprecise.epf [2018-01-21 00:56:37,566 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:56:37,567 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:56:37,568 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:56:37,568 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:56:37,568 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:56:37,568 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:56:37,568 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:56:37,568 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:56:37,569 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:56:37,569 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:56:37,569 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:56:37,569 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:56:37,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:56:37,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:56:37,570 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:56:37,570 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:56:37,570 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:56:37,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:56:37,570 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:56:37,570 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:56:37,570 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:56:37,571 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:56:37,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:56:37,571 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:56:37,571 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:56:37,571 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:56:37,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:56:37,572 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:56:37,572 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:56:37,572 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:56:37,572 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:56:37,572 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:56:37,572 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:56:37,572 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:56:37,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:56:37,573 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:56:37,573 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:56:37,573 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:56:37,574 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:56:37,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:56:37,620 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:56:37,624 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:56:37,625 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:56:37,625 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:56:37,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-01-21 00:56:37,801 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:56:37,804 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:56:37,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:56:37,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:56:37,811 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:56:37,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:56:37" (1/1) ... [2018-01-21 00:56:37,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4b3da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:56:37, skipping insertion in model container [2018-01-21 00:56:37,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:56:37" (1/1) ... [2018-01-21 00:56:37,827 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:56:37,875 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:56:37,995 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:56:38,012 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:56:38,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:56:38 WrapperNode [2018-01-21 00:56:38,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:56:38,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:56:38,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:56:38,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:56:38,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:56:38" (1/1) ... [2018-01-21 00:56:38,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:56:38" (1/1) ... [2018-01-21 00:56:38,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:56:38" (1/1) ... [2018-01-21 00:56:38,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:56:38" (1/1) ... [2018-01-21 00:56:38,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:56:38" (1/1) ... [2018-01-21 00:56:38,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:56:38" (1/1) ... [2018-01-21 00:56:38,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:56:38" (1/1) ... [2018-01-21 00:56:38,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:56:38,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:56:38,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:56:38,057 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:56:38,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:56:38" (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 00:56:38,103 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:56:38,103 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:56:38,103 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 00:56:38,103 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-21 00:56:38,103 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-21 00:56:38,103 INFO L136 BoogieDeclarations]: Found implementation of procedure probe2_6 [2018-01-21 00:56:38,104 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-21 00:56:38,104 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 00:56:38,104 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:56:38,104 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:56:38,104 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:56:38,104 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:56:38,104 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:56:38,104 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:56:38,104 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:56:38,104 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:56:38,105 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:56:38,105 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 00:56:38,105 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-21 00:56:38,105 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-21 00:56:38,105 INFO L128 BoogieDeclarations]: Found specification of procedure probe2_6 [2018-01-21 00:56:38,105 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-21 00:56:38,105 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 00:56:38,105 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:56:38,105 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:56:38,106 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:56:38,310 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:56:38,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:56:38 BoogieIcfgContainer [2018-01-21 00:56:38,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:56:38,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:56:38,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:56:38,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:56:38,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:56:37" (1/3) ... [2018-01-21 00:56:38,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3157d22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:56:38, skipping insertion in model container [2018-01-21 00:56:38,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:56:38" (2/3) ... [2018-01-21 00:56:38,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3157d22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:56:38, skipping insertion in model container [2018-01-21 00:56:38,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:56:38" (3/3) ... [2018-01-21 00:56:38,319 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test6_1_false-valid-memtrack_true-termination.i [2018-01-21 00:56:38,328 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:56:38,334 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-21 00:56:38,374 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:56:38,374 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:56:38,374 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:56:38,374 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:56:38,374 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:56:38,375 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:56:38,375 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:56:38,375 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f6Err0EnsuresViolation======== [2018-01-21 00:56:38,376 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:56:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:56:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:56:38,402 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:56:38,403 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 00:56:38,403 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f6Err0EnsuresViolation]=== [2018-01-21 00:56:38,407 INFO L82 PathProgramCache]: Analyzing trace with hash 838871892, now seen corresponding path program 1 times [2018-01-21 00:56:38,409 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:56:38,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:38,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:56:38,459 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:38,459 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:56:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:56:38,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:56:38,730 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 00:56:38,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:56:38,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:56:38,733 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:56:38,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:56:38,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:56:38,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:38,818 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:56:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:56:38,866 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:56:38,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:56:38,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-21 00:56:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:56:38,873 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:56:38,873 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:56:38,876 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:56:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:56:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:56:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:56:38,895 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-21 00:56:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:56:38,895 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:56:38,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:56:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:56:38,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:56:38,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 00:56:38,954 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-21 00:56:38,954 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:56:38,954 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:56:38,955 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:56:38,955 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 00:56:38,955 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 00:56:38,955 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 00:56:38,955 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:56:38,955 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:56:38,955 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:56:38,956 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 00:56:38,956 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1480) no Hoare annotation was computed. [2018-01-21 00:56:38,956 INFO L401 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2018-01-21 00:56:38,956 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1480) no Hoare annotation was computed. [2018-01-21 00:56:38,957 INFO L401 ceAbstractionStarter]: For program point L1467'(line 1467) no Hoare annotation was computed. [2018-01-21 00:56:38,957 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1480) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 00:56:38,957 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1480) no Hoare annotation was computed. [2018-01-21 00:56:38,957 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1480) the Hoare annotation is: true [2018-01-21 00:56:38,957 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1480) no Hoare annotation was computed. [2018-01-21 00:56:38,957 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1480) the Hoare annotation is: false [2018-01-21 00:56:38,957 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1480) no Hoare annotation was computed. [2018-01-21 00:56:38,957 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1480) no Hoare annotation was computed. [2018-01-21 00:56:38,958 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1478 1480) the Hoare annotation is: true [2018-01-21 00:56:38,958 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1478 1480) no Hoare annotation was computed. [2018-01-21 00:56:38,958 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1478 1480) no Hoare annotation was computed. [2018-01-21 00:56:38,958 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1478 1480) no Hoare annotation was computed. [2018-01-21 00:56:38,958 INFO L401 ceAbstractionStarter]: For program point L1463'(line 1463) no Hoare annotation was computed. [2018-01-21 00:56:38,958 INFO L401 ceAbstractionStarter]: For program point L1463''(line 1463) no Hoare annotation was computed. [2018-01-21 00:56:38,958 INFO L404 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1462 1464) the Hoare annotation is: true [2018-01-21 00:56:38,959 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err0EnsuresViolation(lines 1462 1464) no Hoare annotation was computed. [2018-01-21 00:56:38,959 INFO L401 ceAbstractionStarter]: For program point L1463(line 1463) no Hoare annotation was computed. [2018-01-21 00:56:38,959 INFO L401 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1462 1464) no Hoare annotation was computed. [2018-01-21 00:56:38,959 INFO L401 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1462 1464) no Hoare annotation was computed. [2018-01-21 00:56:38,959 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1470 1476) the Hoare annotation is: true [2018-01-21 00:56:38,959 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1470 1476) no Hoare annotation was computed. [2018-01-21 00:56:38,959 INFO L401 ceAbstractionStarter]: For program point L1472'(lines 1472 1474) no Hoare annotation was computed. [2018-01-21 00:56:38,959 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1470 1476) no Hoare annotation was computed. [2018-01-21 00:56:38,960 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1470 1476) no Hoare annotation was computed. [2018-01-21 00:56:38,960 INFO L401 ceAbstractionStarter]: For program point L1472(lines 1472 1474) no Hoare annotation was computed. [2018-01-21 00:56:38,961 INFO L404 ceAbstractionStarter]: At program point L1473(line 1473) the Hoare annotation is: true [2018-01-21 00:56:38,961 INFO L401 ceAbstractionStarter]: For program point L1471(line 1471) no Hoare annotation was computed. [2018-01-21 00:56:38,962 INFO L401 ceAbstractionStarter]: For program point L1454'(line 1454) no Hoare annotation was computed. [2018-01-21 00:56:38,962 INFO L401 ceAbstractionStarter]: For program point L1451'(line 1451) no Hoare annotation was computed. [2018-01-21 00:56:38,962 INFO L401 ceAbstractionStarter]: For program point L1454(line 1454) no Hoare annotation was computed. [2018-01-21 00:56:38,962 INFO L401 ceAbstractionStarter]: For program point probe2_6EXIT(lines 1443 1460) no Hoare annotation was computed. [2018-01-21 00:56:38,962 INFO L401 ceAbstractionStarter]: For program point L1452(lines 1452 1453) no Hoare annotation was computed. [2018-01-21 00:56:38,962 INFO L401 ceAbstractionStarter]: For program point L1445'(line 1445) no Hoare annotation was computed. [2018-01-21 00:56:38,962 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-21 00:56:38,963 INFO L404 ceAbstractionStarter]: At program point L1451(line 1451) the Hoare annotation is: true [2018-01-21 00:56:38,963 INFO L401 ceAbstractionStarter]: For program point probe2_6Err0EnsuresViolation(lines 1443 1460) no Hoare annotation was computed. [2018-01-21 00:56:38,963 INFO L404 ceAbstractionStarter]: At program point probe2_6ENTRY(lines 1443 1460) the Hoare annotation is: true [2018-01-21 00:56:38,963 INFO L401 ceAbstractionStarter]: For program point L1448'(line 1448) no Hoare annotation was computed. [2018-01-21 00:56:38,963 INFO L401 ceAbstractionStarter]: For program point L1449(lines 1449 1450) no Hoare annotation was computed. [2018-01-21 00:56:38,963 INFO L401 ceAbstractionStarter]: For program point L1458(line 1458) no Hoare annotation was computed. [2018-01-21 00:56:38,963 INFO L404 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: true [2018-01-21 00:56:38,964 INFO L404 ceAbstractionStarter]: At program point L1445(line 1445) the Hoare annotation is: true [2018-01-21 00:56:38,964 INFO L401 ceAbstractionStarter]: For program point L1446(lines 1446 1447) no Hoare annotation was computed. [2018-01-21 00:56:38,964 INFO L401 ceAbstractionStarter]: For program point probe2_6FINAL(lines 1443 1460) no Hoare annotation was computed. [2018-01-21 00:56:38,964 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:56:38,964 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:56:38,964 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-21 00:56:38,964 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:56:38,968 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:56:38,968 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:56:38,968 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:56:38,969 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:56:38,969 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:56:38,969 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:56:38,969 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:56:38,969 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 00:56:38,969 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:56:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:56:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 00:56:38,972 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:56:38,973 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:56:38,973 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 00:56:38,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1107479606, now seen corresponding path program 1 times [2018-01-21 00:56:38,973 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:56:38,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:38,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:56:38,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:38,976 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:56:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:56:38,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:56:39,062 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 00:56:39,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:56:39,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:56:39,063 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:56:39,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:56:39,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:56:39,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,064 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:56:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:56:39,102 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:56:39,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:56:39,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-21 00:56:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:56:39,103 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:56:39,103 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:56:39,104 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:56:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:56:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:56:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:56:39,105 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-21 00:56:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:56:39,106 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:56:39,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:56:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:56:39,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:56:39,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 00:56:39,126 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-21 00:56:39,126 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:56:39,126 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:56:39,126 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:56:39,126 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 00:56:39,126 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 00:56:39,127 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 00:56:39,127 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:56:39,127 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:56:39,127 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:56:39,127 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 00:56:39,127 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1480) no Hoare annotation was computed. [2018-01-21 00:56:39,127 INFO L401 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2018-01-21 00:56:39,127 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1480) no Hoare annotation was computed. [2018-01-21 00:56:39,128 INFO L401 ceAbstractionStarter]: For program point L1467'(line 1467) no Hoare annotation was computed. [2018-01-21 00:56:39,128 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1480) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 00:56:39,128 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1480) no Hoare annotation was computed. [2018-01-21 00:56:39,128 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1480) the Hoare annotation is: true [2018-01-21 00:56:39,128 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1480) no Hoare annotation was computed. [2018-01-21 00:56:39,128 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1480) the Hoare annotation is: false [2018-01-21 00:56:39,128 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1480) no Hoare annotation was computed. [2018-01-21 00:56:39,129 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1480) no Hoare annotation was computed. [2018-01-21 00:56:39,129 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1478 1480) the Hoare annotation is: true [2018-01-21 00:56:39,129 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1478 1480) no Hoare annotation was computed. [2018-01-21 00:56:39,129 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1478 1480) no Hoare annotation was computed. [2018-01-21 00:56:39,129 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1478 1480) no Hoare annotation was computed. [2018-01-21 00:56:39,129 INFO L401 ceAbstractionStarter]: For program point L1463'(line 1463) no Hoare annotation was computed. [2018-01-21 00:56:39,129 INFO L401 ceAbstractionStarter]: For program point L1463''(line 1463) no Hoare annotation was computed. [2018-01-21 00:56:39,129 INFO L404 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1462 1464) the Hoare annotation is: true [2018-01-21 00:56:39,130 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err0EnsuresViolation(lines 1462 1464) no Hoare annotation was computed. [2018-01-21 00:56:39,130 INFO L401 ceAbstractionStarter]: For program point L1463(line 1463) no Hoare annotation was computed. [2018-01-21 00:56:39,130 INFO L401 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1462 1464) no Hoare annotation was computed. [2018-01-21 00:56:39,130 INFO L401 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1462 1464) no Hoare annotation was computed. [2018-01-21 00:56:39,130 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1470 1476) the Hoare annotation is: true [2018-01-21 00:56:39,130 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1470 1476) no Hoare annotation was computed. [2018-01-21 00:56:39,130 INFO L401 ceAbstractionStarter]: For program point L1472'(lines 1472 1474) no Hoare annotation was computed. [2018-01-21 00:56:39,130 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1470 1476) no Hoare annotation was computed. [2018-01-21 00:56:39,131 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1470 1476) no Hoare annotation was computed. [2018-01-21 00:56:39,131 INFO L401 ceAbstractionStarter]: For program point L1472(lines 1472 1474) no Hoare annotation was computed. [2018-01-21 00:56:39,131 INFO L404 ceAbstractionStarter]: At program point L1473(line 1473) the Hoare annotation is: true [2018-01-21 00:56:39,131 INFO L401 ceAbstractionStarter]: For program point L1471(line 1471) no Hoare annotation was computed. [2018-01-21 00:56:39,131 INFO L401 ceAbstractionStarter]: For program point L1454'(line 1454) no Hoare annotation was computed. [2018-01-21 00:56:39,131 INFO L401 ceAbstractionStarter]: For program point L1451'(line 1451) no Hoare annotation was computed. [2018-01-21 00:56:39,131 INFO L401 ceAbstractionStarter]: For program point L1454(line 1454) no Hoare annotation was computed. [2018-01-21 00:56:39,131 INFO L401 ceAbstractionStarter]: For program point probe2_6EXIT(lines 1443 1460) no Hoare annotation was computed. [2018-01-21 00:56:39,131 INFO L401 ceAbstractionStarter]: For program point L1452(lines 1452 1453) no Hoare annotation was computed. [2018-01-21 00:56:39,131 INFO L401 ceAbstractionStarter]: For program point L1445'(line 1445) no Hoare annotation was computed. [2018-01-21 00:56:39,132 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-21 00:56:39,132 INFO L404 ceAbstractionStarter]: At program point L1451(line 1451) the Hoare annotation is: true [2018-01-21 00:56:39,132 INFO L401 ceAbstractionStarter]: For program point probe2_6Err0EnsuresViolation(lines 1443 1460) no Hoare annotation was computed. [2018-01-21 00:56:39,132 INFO L404 ceAbstractionStarter]: At program point probe2_6ENTRY(lines 1443 1460) the Hoare annotation is: true [2018-01-21 00:56:39,132 INFO L401 ceAbstractionStarter]: For program point L1448'(line 1448) no Hoare annotation was computed. [2018-01-21 00:56:39,132 INFO L401 ceAbstractionStarter]: For program point L1449(lines 1449 1450) no Hoare annotation was computed. [2018-01-21 00:56:39,132 INFO L401 ceAbstractionStarter]: For program point L1458(line 1458) no Hoare annotation was computed. [2018-01-21 00:56:39,132 INFO L404 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: true [2018-01-21 00:56:39,133 INFO L404 ceAbstractionStarter]: At program point L1445(line 1445) the Hoare annotation is: true [2018-01-21 00:56:39,133 INFO L401 ceAbstractionStarter]: For program point L1446(lines 1446 1447) no Hoare annotation was computed. [2018-01-21 00:56:39,133 INFO L401 ceAbstractionStarter]: For program point probe2_6FINAL(lines 1443 1460) no Hoare annotation was computed. [2018-01-21 00:56:39,133 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:56:39,133 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:56:39,133 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-21 00:56:39,133 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:56:39,135 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:56:39,136 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:56:39,136 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:56:39,136 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:56:39,136 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:56:39,136 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:56:39,136 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:56:39,136 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:56:39,137 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:56:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:56:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-21 00:56:39,139 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:56:39,139 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-21 00:56:39,139 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:56:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash 96601323, now seen corresponding path program 1 times [2018-01-21 00:56:39,140 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:56:39,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,141 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:56:39,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,142 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:56:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:56:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:56:39,178 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:56:39,184 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:56:39,188 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 00:56:39,188 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 00:56:39,189 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 00:56:39,189 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 00:56:39,192 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:56:39,193 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:56:39,193 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:56:39,193 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:56:39,193 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:56:39,193 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:56:39,193 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:56:39,193 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:56:39,193 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:56:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:56:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:56:39,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:56:39,197 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] [2018-01-21 00:56:39,197 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:56:39,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1405393239, now seen corresponding path program 1 times [2018-01-21 00:56:39,198 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:56:39,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:56:39,199 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,200 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:56:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:56:39,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:56:39,276 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 00:56:39,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:56:39,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:56:39,277 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:56:39,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:56:39,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:56:39,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,278 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:56:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:56:39,311 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:56:39,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:56:39,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-21 00:56:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:56:39,312 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:56:39,312 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:56:39,313 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:56:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:56:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:56:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:56:39,313 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 00:56:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:56:39,314 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:56:39,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:56:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:56:39,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:56:39,316 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:56:39,316 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:56:39,316 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:56:39,316 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:56:39,316 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:56:39,316 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:56:39,316 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:56:39,316 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:56:39,317 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:56:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:56:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:56:39,319 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:56:39,320 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 00:56:39,320 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:56:39,320 INFO L82 PathProgramCache]: Analyzing trace with hash -896860598, now seen corresponding path program 1 times [2018-01-21 00:56:39,320 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:56:39,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:56:39,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,322 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:56:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:56:39,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:56:39,408 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 00:56:39,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:56:39,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:56:39,409 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:56:39,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:56:39,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:56:39,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,410 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:56:39,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:56:39,437 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:56:39,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:56:39,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-21 00:56:39,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:56:39,438 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:56:39,438 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:56:39,439 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:56:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:56:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:56:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:56:39,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 00:56:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:56:39,440 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:56:39,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:56:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:56:39,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:56:39,442 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:56:39,442 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:56:39,442 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:56:39,442 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:56:39,442 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:56:39,443 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:56:39,443 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:56:39,443 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_6Err0EnsuresViolation======== [2018-01-21 00:56:39,443 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:56:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:56:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:56:39,445 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:56:39,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] [2018-01-21 00:56:39,445 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_6Err0EnsuresViolation]=== [2018-01-21 00:56:39,446 INFO L82 PathProgramCache]: Analyzing trace with hash -213900869, now seen corresponding path program 1 times [2018-01-21 00:56:39,446 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:56:39,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:56:39,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,447 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:56:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:56:39,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:56:39,522 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 00:56:39,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:56:39,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:56:39,522 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:56:39,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:56:39,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:56:39,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,523 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:56:39,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:56:39,543 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:56:39,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:56:39,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-21 00:56:39,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:56:39,543 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:56:39,543 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:56:39,544 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:56:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:56:39,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:56:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:56:39,544 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 00:56:39,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:56:39,545 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:56:39,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:56:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:56:39,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:56:39,546 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:56:39,546 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:56:39,546 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:56:39,546 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:56:39,546 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:56:39,546 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:56:39,546 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:56:39,547 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 00:56:39,547 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:56:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:56:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:56:39,549 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:56:39,549 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 00:56:39,549 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 00:56:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1491802513, now seen corresponding path program 1 times [2018-01-21 00:56:39,550 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:56:39,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:56:39,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,551 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:56:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:56:39,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:56:39,613 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 00:56:39,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:56:39,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:56:39,614 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:56:39,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:56:39,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:56:39,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,615 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:56:39,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:56:39,635 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:56:39,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:56:39,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-21 00:56:39,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:56:39,636 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:56:39,636 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:56:39,637 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:56:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:56:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:56:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:56:39,638 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 00:56:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:56:39,638 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:56:39,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:56:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:56:39,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:56:39,639 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:56:39,639 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:56:39,639 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:56:39,639 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:56:39,640 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:56:39,640 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:56:39,640 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:56:39,640 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe2_6Err0EnsuresViolation======== [2018-01-21 00:56:39,640 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:56:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:56:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 00:56:39,642 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:56:39,642 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:56:39,642 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe2_6Err0EnsuresViolation]=== [2018-01-21 00:56:39,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1362254106, now seen corresponding path program 1 times [2018-01-21 00:56:39,642 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:56:39,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:56:39,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,644 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:56:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:56:39,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:56:39,700 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 00:56:39,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:56:39,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:56:39,700 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:56:39,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:56:39,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:56:39,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,701 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:56:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:56:39,719 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:56:39,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:56:39,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-21 00:56:39,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:56:39,720 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:56:39,720 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:56:39,720 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:56:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:56:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:56:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:56:39,721 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-01-21 00:56:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:56:39,721 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:56:39,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:56:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:56:39,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:56:39,722 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:56:39,722 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:56:39,722 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:56:39,722 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:56:39,722 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:56:39,722 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:56:39,723 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:56:39,723 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == g6Err0EnsuresViolation======== [2018-01-21 00:56:39,723 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:56:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:56:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:56:39,725 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:56:39,725 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 00:56:39,725 INFO L371 AbstractCegarLoop]: === Iteration 1 === [g6Err0EnsuresViolation]=== [2018-01-21 00:56:39,725 INFO L82 PathProgramCache]: Analyzing trace with hash 385265649, now seen corresponding path program 1 times [2018-01-21 00:56:39,725 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:56:39,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:56:39,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:56:39,727 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:56:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:56:39,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:56:39,798 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 00:56:39,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:56:39,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:56:39,798 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:56:39,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:56:39,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:56:39,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,799 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:56:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:56:39,815 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:56:39,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:56:39,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-21 00:56:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:56:39,816 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:56:39,816 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:56:39,817 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:56:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:56:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:56:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:56:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:56:39,818 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-21 00:56:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:56:39,818 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:56:39,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:56:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:56:39,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:56:39,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:56:39 BoogieIcfgContainer [2018-01-21 00:56:39,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:56:39,822 INFO L168 Benchmark]: Toolchain (without parser) took 2020.23 ms. Allocated memory was 306.2 MB in the beginning and 469.2 MB in the end (delta: 163.1 MB). Free memory was 263.1 MB in the beginning and 325.0 MB in the end (delta: -61.9 MB). Peak memory consumption was 101.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:56:39,823 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 306.2 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:56:39,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.39 ms. Allocated memory is still 306.2 MB. Free memory was 263.1 MB in the beginning and 249.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. [2018-01-21 00:56:39,824 INFO L168 Benchmark]: Boogie Preprocessor took 34.24 ms. Allocated memory is still 306.2 MB. Free memory was 249.8 MB in the beginning and 247.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 00:56:39,824 INFO L168 Benchmark]: RCFGBuilder took 253.82 ms. Allocated memory is still 306.2 MB. Free memory was 247.8 MB in the beginning and 228.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:56:39,825 INFO L168 Benchmark]: TraceAbstraction took 1509.91 ms. Allocated memory was 306.2 MB in the beginning and 469.2 MB in the end (delta: 163.1 MB). Free memory was 228.8 MB in the beginning and 325.0 MB in the end (delta: -96.2 MB). Peak memory consumption was 66.8 MB. Max. memory is 5.3 GB. [2018-01-21 00:56:39,826 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 306.2 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.39 ms. Allocated memory is still 306.2 MB. Free memory was 263.1 MB in the beginning and 249.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.24 ms. Allocated memory is still 306.2 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 253.82 ms. Allocated memory is still 306.2 MB. Free memory was 247.8 MB in the beginning and 228.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1509.91 ms. Allocated memory was 306.2 MB in the beginning and 469.2 MB in the end (delta: 163.1 MB). Free memory was 228.8 MB in the beginning and 325.0 MB in the end (delta: -96.2 MB). Peak memory consumption was 66.8 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1434]: 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: f6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 15 NumberOfFragments, 17 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 988 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: 1072]: 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_mallocErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 15 NumberOfFragments, 17 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 598 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: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1467] FCALL struct A a6; VAL [\old(a6)=null, \old(a6)=null, a6={7:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 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=62occurred 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, 5 NumberOfCodeBlocks, 5 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: 1]: 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: ULTIMATE.startErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 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: 1478]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 3 SDslu, 0 SDs, 0 SdLazy, 13 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 1368 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: 1462]: 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: disconnect_6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 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: 1470]: 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 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, 1210 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: 1443]: 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: probe2_6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 850 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1438]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: g6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 1450 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 - InvariantResult [Line: 1450]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-56-39-840.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-56-39-840.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-56-39-840.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-56-39-840.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-56-39-840.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_00-56-39-840.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_00-56-39-840.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_00-56-39-840.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_00-56-39-840.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-21_00-56-39-840.csv Received shutdown request...