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_mostprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 03:29:57,288 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 03:29:57,290 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 03:29:57,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 03:29:57,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 03:29:57,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 03:29:57,313 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 03:29:57,314 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 03:29:57,316 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 03:29:57,317 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 03:29:57,318 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 03:29:57,319 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 03:29:57,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 03:29:57,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 03:29:57,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 03:29:57,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 03:29:57,327 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 03:29:57,329 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 03:29:57,330 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 03:29:57,332 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 03:29:57,334 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 03:29:57,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 03:29:57,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 03:29:57,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 03:29:57,336 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 03:29:57,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 03:29:57,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 03:29:57,339 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 03:29:57,340 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 03:29:57,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 03:29:57,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 03:29:57,341 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_mostprecise.epf [2018-01-21 03:29:57,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 03:29:57,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 03:29:57,358 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 03:29:57,358 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 03:29:57,358 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 03:29:57,358 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 03:29:57,359 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 03:29:57,359 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 03:29:57,359 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 03:29:57,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 03:29:57,360 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 03:29:57,362 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 03:29:57,362 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 03:29:57,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 03:29:57,363 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 03:29:57,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 03:29:57,363 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 03:29:57,363 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 03:29:57,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 03:29:57,364 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 03:29:57,364 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 03:29:57,364 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 03:29:57,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 03:29:57,365 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 03:29:57,365 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 03:29:57,365 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 03:29:57,365 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 03:29:57,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 03:29:57,366 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 03:29:57,366 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 03:29:57,368 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 03:29:57,368 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 03:29:57,368 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 03:29:57,368 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 03:29:57,368 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 03:29:57,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 03:29:57,369 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 03:29:57,369 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 03:29:57,370 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 03:29:57,370 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 03:29:57,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 03:29:57,421 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 03:29:57,424 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 03:29:57,425 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 03:29:57,426 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 03:29:57,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i [2018-01-21 03:29:57,652 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 03:29:57,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 03:29:57,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 03:29:57,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 03:29:57,666 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 03:29:57,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:29:57" (1/1) ... [2018-01-21 03:29:57,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a8c6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:29:57, skipping insertion in model container [2018-01-21 03:29:57,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:29:57" (1/1) ... [2018-01-21 03:29:57,687 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:29:57,738 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:29:57,867 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:29:57,886 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:29:57,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:29:57 WrapperNode [2018-01-21 03:29:57,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 03:29:57,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 03:29:57,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 03:29:57,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 03:29:57,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:29:57" (1/1) ... [2018-01-21 03:29:57,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:29:57" (1/1) ... [2018-01-21 03:29:57,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:29:57" (1/1) ... [2018-01-21 03:29:57,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:29:57" (1/1) ... [2018-01-21 03:29:57,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:29:57" (1/1) ... [2018-01-21 03:29:57,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:29:57" (1/1) ... [2018-01-21 03:29:57,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:29:57" (1/1) ... [2018-01-21 03:29:57,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 03:29:57,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 03:29:57,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 03:29:57,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 03:29:57,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:29:57" (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 03:29:57,996 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 03:29:57,997 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 03:29:57,997 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 03:29:57,997 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-21 03:29:57,997 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-21 03:29:57,997 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-21 03:29:57,997 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-01-21 03:29:57,997 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 03:29:57,998 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 03:29:57,998 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 03:29:57,998 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 03:29:57,998 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 03:29:57,998 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 03:29:57,998 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 03:29:57,999 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 03:29:57,999 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 03:29:57,999 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 03:29:57,999 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 03:29:57,999 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-21 03:29:58,000 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-21 03:29:58,000 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-21 03:29:58,000 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-01-21 03:29:58,000 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 03:29:58,000 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 03:29:58,000 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 03:29:58,001 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 03:29:58,332 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 03:29:58,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:29:58 BoogieIcfgContainer [2018-01-21 03:29:58,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 03:29:58,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 03:29:58,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 03:29:58,336 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 03:29:58,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 03:29:57" (1/3) ... [2018-01-21 03:29:58,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2414c192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:29:58, skipping insertion in model container [2018-01-21 03:29:58,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:29:57" (2/3) ... [2018-01-21 03:29:58,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2414c192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:29:58, skipping insertion in model container [2018-01-21 03:29:58,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:29:58" (3/3) ... [2018-01-21 03:29:58,340 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test7_false-valid-memtrack_true-termination.i [2018-01-21 03:29:58,348 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 03:29:58,355 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-21 03:29:58,408 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:29:58,408 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:29:58,408 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:29:58,408 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:29:58,408 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:29:58,409 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:29:58,409 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:29:58,409 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f6Err0EnsuresViolation======== [2018-01-21 03:29:58,410 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:29:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 03:29:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 03:29:58,436 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:29:58,437 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:29:58,437 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f6Err0EnsuresViolation]=== [2018-01-21 03:29:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash -5063144, now seen corresponding path program 1 times [2018-01-21 03:29:58,443 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:29:58,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:58,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:29:58,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:58,492 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:29:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:29:58,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:29:58,808 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 03:29:58,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:29:58,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:29:58,811 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:29:58,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:29:58,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:29:58,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:29:58,897 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 5 states. [2018-01-21 03:29:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:29:58,960 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-01-21 03:29:58,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:29:58,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-21 03:29:58,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:29:58,968 INFO L225 Difference]: With dead ends: 103 [2018-01-21 03:29:58,968 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:29:58,973 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:29:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:29:58,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:29:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:29:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:29:58,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-01-21 03:29:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:29:58,996 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:29:58,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:29:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:29:58,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:29:59,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 03:29:59,040 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-21 03:29:59,040 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 03:29:59,040 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 03:29:59,040 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 03:29:59,040 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 03:29:59,040 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 03:29:59,040 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 03:29:59,040 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 03:29:59,041 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 03:29:59,041 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 03:29:59,041 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 03:29:59,041 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1475) no Hoare annotation was computed. [2018-01-21 03:29:59,041 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1475) no Hoare annotation was computed. [2018-01-21 03:29:59,041 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1475) the Hoare annotation is: true [2018-01-21 03:29:59,041 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1475) no Hoare annotation was computed. [2018-01-21 03:29:59,041 INFO L404 ceAbstractionStarter]: At program point disconnect_2_6ENTRY(lines 1461 1462) the Hoare annotation is: true [2018-01-21 03:29:59,041 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6EXIT(lines 1461 1462) no Hoare annotation was computed. [2018-01-21 03:29:59,042 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6FINAL(lines 1461 1462) no Hoare annotation was computed. [2018-01-21 03:29:59,042 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6Err0EnsuresViolation(lines 1461 1462) no Hoare annotation was computed. [2018-01-21 03:29:59,042 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1475) the Hoare annotation is: true [2018-01-21 03:29:59,042 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1475) no Hoare annotation was computed. [2018-01-21 03:29:59,042 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1475) the Hoare annotation is: true [2018-01-21 03:29:59,042 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1475) no Hoare annotation was computed. [2018-01-21 03:29:59,042 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1475) no Hoare annotation was computed. [2018-01-21 03:29:59,042 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1473 1475) the Hoare annotation is: true [2018-01-21 03:29:59,043 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1473 1475) no Hoare annotation was computed. [2018-01-21 03:29:59,043 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1473 1475) no Hoare annotation was computed. [2018-01-21 03:29:59,043 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1473 1475) no Hoare annotation was computed. [2018-01-21 03:29:59,043 INFO L401 ceAbstractionStarter]: For program point L1466'(line 1466) no Hoare annotation was computed. [2018-01-21 03:29:59,043 INFO L404 ceAbstractionStarter]: At program point L1466(line 1466) the Hoare annotation is: true [2018-01-21 03:29:59,043 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1465 1471) no Hoare annotation was computed. [2018-01-21 03:29:59,044 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1465 1471) no Hoare annotation was computed. [2018-01-21 03:29:59,044 INFO L401 ceAbstractionStarter]: For program point L1468'(lines 1468 1470) no Hoare annotation was computed. [2018-01-21 03:29:59,044 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1465 1471) the Hoare annotation is: true [2018-01-21 03:29:59,044 INFO L404 ceAbstractionStarter]: At program point L1469(line 1469) the Hoare annotation is: true [2018-01-21 03:29:59,044 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1465 1471) no Hoare annotation was computed. [2018-01-21 03:29:59,044 INFO L401 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2018-01-21 03:29:59,044 INFO L401 ceAbstractionStarter]: For program point L1468(lines 1468 1470) no Hoare annotation was computed. [2018-01-21 03:29:59,044 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 03:29:59,044 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 03:29:59,045 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-21 03:29:59,045 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 03:29:59,045 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-21 03:29:59,045 INFO L404 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: true [2018-01-21 03:29:59,045 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-21 03:29:59,045 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-21 03:29:59,045 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-21 03:29:59,046 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-21 03:29:59,046 INFO L404 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: true [2018-01-21 03:29:59,046 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-21 03:29:59,046 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0EnsuresViolation(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 03:29:59,046 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-21 03:29:59,046 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-21 03:29:59,046 INFO L404 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: true [2018-01-21 03:29:59,047 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 03:29:59,047 INFO L404 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: true [2018-01-21 03:29:59,047 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-21 03:29:59,047 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-21 03:29:59,047 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 03:29:59,051 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:29:59,051 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:29:59,052 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:29:59,052 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:29:59,052 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:29:59,052 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:29:59,052 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:29:59,052 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 03:29:59,052 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:29:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 03:29:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 03:29:59,056 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:29:59,056 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:29:59,056 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 03:29:59,056 INFO L82 PathProgramCache]: Analyzing trace with hash -416946598, now seen corresponding path program 1 times [2018-01-21 03:29:59,056 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:29:59,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:29:59,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:29:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:29:59,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:29:59,106 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 03:29:59,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:29:59,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:29:59,107 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:29:59,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:29:59,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:29:59,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:29:59,108 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-01-21 03:29:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:29:59,206 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-21 03:29:59,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:29:59,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-21 03:29:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:29:59,209 INFO L225 Difference]: With dead ends: 63 [2018-01-21 03:29:59,209 INFO L226 Difference]: Without dead ends: 16 [2018-01-21 03:29:59,210 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:29:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-01-21 03:29:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-01-21 03:29:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-01-21 03:29:59,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-01-21 03:29:59,221 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 13 [2018-01-21 03:29:59,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:29:59,221 INFO L432 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-01-21 03:29:59,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:29:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-01-21 03:29:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 03:29:59,222 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:29:59,222 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:29:59,223 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 03:29:59,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1253814916, now seen corresponding path program 1 times [2018-01-21 03:29:59,223 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:29:59,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:29:59,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,225 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:29:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:29:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:29:59,285 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:29:59,291 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:29:59,293 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:29:59,303 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:29:59,303 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:29:59,304 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:29:59,304 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:29:59,304 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:29:59,304 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:29:59,304 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:29:59,304 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 03:29:59,304 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:29:59,305 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 03:29:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 03:29:59,306 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:29:59,306 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 03:29:59,306 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 03:29:59,306 INFO L82 PathProgramCache]: Analyzing trace with hash 98600, now seen corresponding path program 1 times [2018-01-21 03:29:59,306 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:29:59,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,307 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:29:59,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,308 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:29:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:29:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:29:59,315 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:29:59,316 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:29:59,318 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:29:59,319 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:29:59,319 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:29:59,319 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:29:59,319 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:29:59,319 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:29:59,319 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:29:59,319 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_2_6Err0EnsuresViolation======== [2018-01-21 03:29:59,320 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:29:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 03:29:59,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 03:29:59,323 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:29:59,323 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 03:29:59,323 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_2_6Err0EnsuresViolation]=== [2018-01-21 03:29:59,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2042031145, now seen corresponding path program 1 times [2018-01-21 03:29:59,323 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:29:59,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:29:59,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,325 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:29:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:29:59,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:29:59,360 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 03:29:59,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:29:59,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-01-21 03:29:59,361 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:29:59,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:29:59,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:29:59,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:29:59,362 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-21 03:29:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:29:59,367 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-21 03:29:59,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:29:59,367 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-21 03:29:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:29:59,368 INFO L225 Difference]: With dead ends: 59 [2018-01-21 03:29:59,368 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:29:59,368 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:29:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:29:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:29:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:29:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:29:59,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 03:29:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:29:59,370 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:29:59,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:29:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:29:59,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:29:59,372 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:29:59,372 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:29:59,372 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:29:59,372 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:29:59,373 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:29:59,373 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:29:59,373 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:29:59,373 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 03:29:59,373 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:29:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 03:29:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 03:29:59,377 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:29:59,377 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 03:29:59,377 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:29:59,377 INFO L82 PathProgramCache]: Analyzing trace with hash -151398166, now seen corresponding path program 1 times [2018-01-21 03:29:59,377 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:29:59,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:29:59,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,379 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:29:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:29:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:29:59,414 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:29:59,417 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:29:59,418 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:29:59,419 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:29:59,420 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:29:59,420 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:29:59,420 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:29:59,424 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:29:59,424 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:29:59,424 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:29:59,425 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:29:59,425 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:29:59,425 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:29:59,425 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:29:59,425 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 03:29:59,425 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:29:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 03:29:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 03:29:59,427 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:29:59,427 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 03:29:59,428 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 03:29:59,428 INFO L82 PathProgramCache]: Analyzing trace with hash -357699046, now seen corresponding path program 1 times [2018-01-21 03:29:59,428 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:29:59,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:29:59,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,429 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:29:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:29:59,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:29:59,478 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 03:29:59,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:29:59,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:29:59,478 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:29:59,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:29:59,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:29:59,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:29:59,479 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-01-21 03:29:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:29:59,537 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-21 03:29:59,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:29:59,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-21 03:29:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:29:59,538 INFO L225 Difference]: With dead ends: 63 [2018-01-21 03:29:59,538 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:29:59,538 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:29:59,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:29:59,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:29:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:29:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:29:59,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 03:29:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:29:59,539 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:29:59,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:29:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:29:59,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:29:59,541 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:29:59,541 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:29:59,541 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:29:59,541 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:29:59,541 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:29:59,541 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:29:59,541 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:29:59,541 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 03:29:59,542 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:29:59,542 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 03:29:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 03:29:59,543 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:29:59,544 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 03:29:59,544 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 03:29:59,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2042083615, now seen corresponding path program 1 times [2018-01-21 03:29:59,544 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:29:59,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:29:59,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,545 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:29:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:29:59,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:29:59,631 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 03:29:59,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:29:59,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 03:29:59,632 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:29:59,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:29:59,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:29:59,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:29:59,632 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 4 states. [2018-01-21 03:29:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:29:59,770 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-21 03:29:59,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:29:59,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-21 03:29:59,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:29:59,771 INFO L225 Difference]: With dead ends: 63 [2018-01-21 03:29:59,771 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:29:59,772 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:29:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:29:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:29:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:29:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:29:59,773 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 03:29:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:29:59,773 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:29:59,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:29:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:29:59,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:29:59,776 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:29:59,777 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:29:59,777 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:29:59,777 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:29:59,777 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:29:59,777 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:29:59,777 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:29:59,777 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == g6Err0EnsuresViolation======== [2018-01-21 03:29:59,777 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:29:59,778 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 03:29:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 03:29:59,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:29:59,780 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 03:29:59,780 INFO L371 AbstractCegarLoop]: === Iteration 1 === [g6Err0EnsuresViolation]=== [2018-01-21 03:29:59,780 INFO L82 PathProgramCache]: Analyzing trace with hash 564380501, now seen corresponding path program 1 times [2018-01-21 03:29:59,780 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:29:59,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:29:59,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,782 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:29:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:29:59,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:29:59,844 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 03:29:59,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:29:59,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:29:59,845 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:29:59,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:29:59,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:29:59,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:29:59,847 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 5 states. [2018-01-21 03:29:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:29:59,879 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-01-21 03:29:59,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:29:59,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-21 03:29:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:29:59,880 INFO L225 Difference]: With dead ends: 103 [2018-01-21 03:29:59,880 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:29:59,881 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:29:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:29:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:29:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:29:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:29:59,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 03:29:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:29:59,883 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:29:59,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:29:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:29:59,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:29:59,884 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:29:59,884 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:29:59,885 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:29:59,885 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:29:59,885 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:29:59,885 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:29:59,885 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:29:59,885 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe1_6Err0EnsuresViolation======== [2018-01-21 03:29:59,885 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:29:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 03:29:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 03:29:59,887 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:29:59,887 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:29:59,888 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe1_6Err0EnsuresViolation]=== [2018-01-21 03:29:59,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2060327594, now seen corresponding path program 1 times [2018-01-21 03:29:59,888 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:29:59,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:29:59,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:29:59,890 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:29:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:29:59,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:29:59,936 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 03:29:59,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:29:59,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:29:59,937 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:29:59,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:29:59,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:29:59,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:29:59,938 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-01-21 03:30:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:30:00,000 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-21 03:30:00,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:30:00,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 03:30:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:30:00,002 INFO L225 Difference]: With dead ends: 63 [2018-01-21 03:30:00,002 INFO L226 Difference]: Without dead ends: 35 [2018-01-21 03:30:00,003 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:30:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-21 03:30:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-01-21 03:30:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-21 03:30:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-21 03:30:00,008 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 17 [2018-01-21 03:30:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:30:00,009 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-21 03:30:00,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:30:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-21 03:30:00,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 03:30:00,010 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:30:00,010 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 03:30:00,010 INFO L371 AbstractCegarLoop]: === Iteration 2 === [probe1_6Err0EnsuresViolation]=== [2018-01-21 03:30:00,011 INFO L82 PathProgramCache]: Analyzing trace with hash 564305637, now seen corresponding path program 1 times [2018-01-21 03:30:00,011 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:30:00,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:30:00,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:30:00,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:30:00,012 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:30:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:30:00,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:30:00,081 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 03:30:00,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:30:00,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:30:00,082 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:30:00,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:30:00,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:30:00,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:30:00,083 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 5 states. [2018-01-21 03:30:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:30:00,104 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-21 03:30:00,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:30:00,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-21 03:30:00,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:30:00,107 INFO L225 Difference]: With dead ends: 54 [2018-01-21 03:30:00,107 INFO L226 Difference]: Without dead ends: 34 [2018-01-21 03:30:00,108 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:30:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-21 03:30:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-21 03:30:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-21 03:30:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-01-21 03:30:00,114 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 25 [2018-01-21 03:30:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:30:00,114 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-01-21 03:30:00,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:30:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-01-21 03:30:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 03:30:00,115 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:30:00,116 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 03:30:00,116 INFO L371 AbstractCegarLoop]: === Iteration 3 === [probe1_6Err0EnsuresViolation]=== [2018-01-21 03:30:00,116 INFO L82 PathProgramCache]: Analyzing trace with hash 398811911, now seen corresponding path program 1 times [2018-01-21 03:30:00,116 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:30:00,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:30:00,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:30:00,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:30:00,118 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:30:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:30:00,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:30:00,157 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 03:30:00,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:30:00,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 03:30:00,157 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:30:00,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:30:00,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:30:00,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:30:00,158 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 4 states. [2018-01-21 03:30:00,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:30:00,181 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-01-21 03:30:00,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 03:30:00,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-21 03:30:00,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:30:00,182 INFO L225 Difference]: With dead ends: 34 [2018-01-21 03:30:00,182 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:30:00,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:30:00,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:30:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:30:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:30:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:30:00,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 03:30:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:30:00,183 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:30:00,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:30:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:30:00,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:30:00,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 03:30:00 BoogieIcfgContainer [2018-01-21 03:30:00,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 03:30:00,188 INFO L168 Benchmark]: Toolchain (without parser) took 2534.89 ms. Allocated memory was 306.7 MB in the beginning and 444.6 MB in the end (delta: 137.9 MB). Free memory was 264.0 MB in the beginning and 378.8 MB in the end (delta: -114.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. [2018-01-21 03:30:00,189 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 306.7 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:30:00,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.36 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 251.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:30:00,190 INFO L168 Benchmark]: Boogie Preprocessor took 41.34 ms. Allocated memory is still 306.7 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:30:00,190 INFO L168 Benchmark]: RCFGBuilder took 395.64 ms. Allocated memory is still 306.7 MB. Free memory was 249.1 MB in the beginning and 231.5 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-21 03:30:00,190 INFO L168 Benchmark]: TraceAbstraction took 1853.08 ms. Allocated memory was 306.7 MB in the beginning and 444.6 MB in the end (delta: 137.9 MB). Free memory was 230.5 MB in the beginning and 378.8 MB in the end (delta: -148.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:30:00,192 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.12 ms. Allocated memory is still 306.7 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.36 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 251.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.34 ms. Allocated memory is still 306.7 MB. Free memory was 251.1 MB in the beginning and 249.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 395.64 ms. Allocated memory is still 306.7 MB. Free memory was 249.1 MB in the beginning and 231.5 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1853.08 ms. Allocated memory was 306.7 MB in the beginning and 444.6 MB in the end (delta: 137.9 MB). Free memory was 230.5 MB in the beginning and 378.8 MB in the end (delta: -148.3 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * 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, 59 locations, 9 error locations. SAFE Result, 0.6s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 58 SDtfs, 4 SDslu, 169 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 16 LocationsWithAnnotation, 19 PreInvPairs, 23 NumberOfFragments, 16 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 756 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: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1474] CALL entry_point() [L1466] FCALL struct A a7; VAL [a7={7:0}] [L1467] CALL probe1_6(&a7) VAL [a={7:0}] [L1443] int ret = - -3; VAL [a={7:0}, a={7:0}, ret=3] [L1444] CALL ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={6:0}, size=4] [L1074] return malloc(size); VAL [\old(size)=4, \result={6:0}, malloc(size)={6:0}, size=4] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 9 procedures, 59 locations, 9 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 22 SDslu, 6 SDs, 0 SdLazy, 25 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 9 procedures, 59 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=59occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1461]: 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_2_6Err0EnsuresViolation CFG has 9 procedures, 59 locations, 9 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 484 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: [L1474] CALL entry_point() [L1466] FCALL struct A a7; VAL [a7={6:0}] [L1467] CALL, EXPR probe1_6(&a7) VAL [a={6:0}] [L1443] int ret = - -3; VAL [a={6:0}, a={6:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=4, \result={0:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={6:0}, a={6:0}, ldv_malloc(sizeof(int))={0:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND TRUE p==0 [L1446] RET return ret; VAL [\result=3, a={6:0}, a={6:0}, p={0:0}, ret=3] [L1467] EXPR probe1_6(&a7) VAL [a7={6:0}, probe1_6(&a7)=3] [L1467] int ret = probe1_6(&a7); [L1468] COND FALSE, RET !(ret==0) VAL [a7={6:0}, ret=3] [L1474] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 9 procedures, 59 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=59occurred 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, 27 NumberOfCodeBlocks, 27 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: 1473]: 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, 59 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 24 SDslu, 6 SDs, 0 SdLazy, 25 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 720 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: 1465]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: entry_pointErr0EnsuresViolation CFG has 9 procedures, 59 locations, 9 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 19 SDslu, 22 SDs, 0 SdLazy, 61 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 1540 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, 59 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 58 SDtfs, 4 SDslu, 169 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 1152 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: 1442]: 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: probe1_6Err0EnsuresViolation CFG has 9 procedures, 59 locations, 9 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 93 SDtfs, 19 SDslu, 108 SDs, 0 SdLazy, 47 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 2684 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 1452]: 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_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_03-30-00-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_03-30-00-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_03-30-00-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_03-30-00-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_03-30-00-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_03-30-00-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_03-30-00-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_03-30-00-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_03-30-00-204.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-21_03-30-00-204.csv Received shutdown request...