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.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:58:40,087 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:58:40,089 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:58:40,104 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:58:40,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:58:40,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:58:40,106 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:58:40,108 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:58:40,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:58:40,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:58:40,112 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:58:40,112 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:58:40,113 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:58:40,115 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:58:40,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:58:40,118 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:58:40,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:58:40,122 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:58:40,124 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:58:40,125 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:58:40,128 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:58:40,128 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:58:40,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:58:40,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:58:40,130 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:58:40,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:58:40,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:58:40,133 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:58:40,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:58:40,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:58:40,134 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:58:40,134 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.epf [2018-01-20 23:58:40,143 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:58:40,144 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:58:40,144 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:58:40,145 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:58:40,145 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:58:40,145 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:58:40,145 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:58:40,145 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:58:40,146 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:58:40,146 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:58:40,146 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:58:40,146 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:58:40,146 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:58:40,146 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:58:40,146 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:58:40,147 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:58:40,147 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:58:40,147 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:58:40,147 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:58:40,147 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:58:40,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:58:40,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:58:40,148 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:58:40,148 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:58:40,148 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:58:40,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:58:40,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:58:40,149 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:58:40,149 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:58:40,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:58:40,149 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:58:40,149 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:58:40,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:58:40,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:58:40,149 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:58:40,149 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:58:40,150 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:58:40,150 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:58:40,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:58:40,193 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:58:40,196 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:58:40,197 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:58:40,198 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:58:40,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-01-20 23:58:40,380 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:58:40,384 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:58:40,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:58:40,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:58:40,391 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:58:40,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:58:40" (1/1) ... [2018-01-20 23:58:40,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f424e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:40, skipping insertion in model container [2018-01-20 23:58:40,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:58:40" (1/1) ... [2018-01-20 23:58:40,410 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:58:40,457 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:58:40,570 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:58:40,589 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:58:40,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:40 WrapperNode [2018-01-20 23:58:40,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:58:40,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:58:40,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:58:40,600 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:58:40,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:40" (1/1) ... [2018-01-20 23:58:40,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:40" (1/1) ... [2018-01-20 23:58:40,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:40" (1/1) ... [2018-01-20 23:58:40,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:40" (1/1) ... [2018-01-20 23:58:40,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:40" (1/1) ... [2018-01-20 23:58:40,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:40" (1/1) ... [2018-01-20 23:58:40,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:40" (1/1) ... [2018-01-20 23:58:40,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:58:40,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:58:40,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:58:40,632 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:58:40,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:40" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:58:40,680 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:58:40,680 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:58:40,680 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-20 23:58:40,681 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-20 23:58:40,681 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-20 23:58:40,681 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-20 23:58:40,681 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-01-20 23:58:40,681 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-20 23:58:40,681 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:58:40,682 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 23:58:40,682 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 23:58:40,682 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:58:40,682 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:58:40,682 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:58:40,682 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:58:40,682 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:58:40,683 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:58:40,683 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-20 23:58:40,683 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-20 23:58:40,683 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-20 23:58:40,683 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-20 23:58:40,683 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-01-20 23:58:40,684 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-20 23:58:40,684 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:58:40,684 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:58:40,684 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:58:40,904 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:58:40,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:58:40 BoogieIcfgContainer [2018-01-20 23:58:40,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:58:40,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:58:40,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:58:40,907 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:58:40,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:58:40" (1/3) ... [2018-01-20 23:58:40,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9d57ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:58:40, skipping insertion in model container [2018-01-20 23:58:40,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:58:40" (2/3) ... [2018-01-20 23:58:40,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9d57ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:58:40, skipping insertion in model container [2018-01-20 23:58:40,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:58:40" (3/3) ... [2018-01-20 23:58:40,910 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-01-20 23:58:40,916 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:58:40,925 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-20 23:58:40,977 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:40,977 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:40,977 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:40,977 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:40,978 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:40,978 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:40,978 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:40,978 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f6Err0EnsuresViolation======== [2018-01-20 23:58:40,979 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 23:58:41,009 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:41,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] [2018-01-20 23:58:41,011 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f6Err0EnsuresViolation]=== [2018-01-20 23:58:41,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1409968181, now seen corresponding path program 1 times [2018-01-20 23:58:41,020 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:41,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:41,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:41,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:41,087 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:41,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:58:41,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:41,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:58:41,371 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:41,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:58:41,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:58:41,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:41,460 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-20 23:58:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:41,514 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-20 23:58:41,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:58:41,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-20 23:58:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:41,524 INFO L225 Difference]: With dead ends: 59 [2018-01-20 23:58:41,524 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:41,528 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:41,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-20 23:58:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:41,557 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:41,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:58:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:41,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:41,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 23:58:41,599 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-20 23:58:41,599 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-20 23:58:41,599 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-20 23:58:41,599 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-20 23:58:41,600 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-20 23:58:41,600 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-20 23:58:41,600 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-20 23:58:41,600 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:58:41,600 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:58:41,600 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:58:41,600 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-20 23:58:41,601 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,601 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-20 23:58:41,601 INFO L401 ceAbstractionStarter]: For program point L1465(line 1465) no Hoare annotation was computed. [2018-01-20 23:58:41,601 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,601 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1478) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 23:58:41,601 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,602 INFO L404 ceAbstractionStarter]: At program point disconnect_2_6ENTRY(lines 1461 1462) the Hoare annotation is: true [2018-01-20 23:58:41,602 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6EXIT(lines 1461 1462) no Hoare annotation was computed. [2018-01-20 23:58:41,602 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6FINAL(lines 1461 1462) no Hoare annotation was computed. [2018-01-20 23:58:41,602 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6Err0EnsuresViolation(lines 1461 1462) no Hoare annotation was computed. [2018-01-20 23:58:41,602 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1478) the Hoare annotation is: true [2018-01-20 23:58:41,602 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,602 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1478) the Hoare annotation is: false [2018-01-20 23:58:41,603 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,603 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,603 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1476 1478) the Hoare annotation is: true [2018-01-20 23:58:41,603 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1476 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,603 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1476 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,603 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1476 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,603 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1468 1474) the Hoare annotation is: true [2018-01-20 23:58:41,604 INFO L401 ceAbstractionStarter]: For program point L1469(line 1469) no Hoare annotation was computed. [2018-01-20 23:58:41,604 INFO L401 ceAbstractionStarter]: For program point L1470'(lines 1470 1472) no Hoare annotation was computed. [2018-01-20 23:58:41,604 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1468 1474) no Hoare annotation was computed. [2018-01-20 23:58:41,604 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1468 1474) no Hoare annotation was computed. [2018-01-20 23:58:41,604 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1468 1474) no Hoare annotation was computed. [2018-01-20 23:58:41,604 INFO L401 ceAbstractionStarter]: For program point L1470(lines 1470 1472) no Hoare annotation was computed. [2018-01-20 23:58:41,604 INFO L404 ceAbstractionStarter]: At program point L1471(line 1471) the Hoare annotation is: true [2018-01-20 23:58:41,605 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-20 23:58:41,605 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-20 23:58:41,605 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-20 23:58:41,605 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-20 23:58:41,605 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-20 23:58:41,605 INFO L404 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: true [2018-01-20 23:58:41,605 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-20 23:58:41,606 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-20 23:58:41,606 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-20 23:58:41,606 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-20 23:58:41,606 INFO L404 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: true [2018-01-20 23:58:41,606 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-20 23:58:41,606 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0EnsuresViolation(lines 1442 1459) no Hoare annotation was computed. [2018-01-20 23:58:41,606 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-20 23:58:41,607 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-20 23:58:41,607 INFO L404 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: true [2018-01-20 23:58:41,607 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-20 23:58:41,607 INFO L404 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: true [2018-01-20 23:58:41,607 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-20 23:58:41,607 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-20 23:58:41,607 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-20 23:58:41,611 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:41,611 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:41,611 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:41,612 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:41,612 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:41,612 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:41,612 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:41,612 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-20 23:58:41,612 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-20 23:58:41,615 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:41,615 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:58:41,616 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:58:41,616 INFO L82 PathProgramCache]: Analyzing trace with hash 412789303, now seen corresponding path program 1 times [2018-01-20 23:58:41,616 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:41,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:41,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:41,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:41,618 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:41,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:58:41,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:41,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:58:41,716 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:41,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:58:41,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:58:41,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:41,717 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-20 23:58:41,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:41,739 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-20 23:58:41,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:58:41,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-20 23:58:41,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:41,740 INFO L225 Difference]: With dead ends: 59 [2018-01-20 23:58:41,740 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:41,741 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:41,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:41,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-20 23:58:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:41,741 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:41,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:58:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:41,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:41,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 23:58:41,778 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-20 23:58:41,778 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-20 23:58:41,778 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-20 23:58:41,778 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-20 23:58:41,778 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-20 23:58:41,779 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-20 23:58:41,779 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-20 23:58:41,779 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:58:41,779 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:58:41,779 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:58:41,779 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-20 23:58:41,779 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,779 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-20 23:58:41,779 INFO L401 ceAbstractionStarter]: For program point L1465(line 1465) no Hoare annotation was computed. [2018-01-20 23:58:41,779 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,780 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1478) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-20 23:58:41,780 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,780 INFO L404 ceAbstractionStarter]: At program point disconnect_2_6ENTRY(lines 1461 1462) the Hoare annotation is: true [2018-01-20 23:58:41,780 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6EXIT(lines 1461 1462) no Hoare annotation was computed. [2018-01-20 23:58:41,780 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6FINAL(lines 1461 1462) no Hoare annotation was computed. [2018-01-20 23:58:41,780 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6Err0EnsuresViolation(lines 1461 1462) no Hoare annotation was computed. [2018-01-20 23:58:41,780 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1478) the Hoare annotation is: true [2018-01-20 23:58:41,780 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,780 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1478) the Hoare annotation is: false [2018-01-20 23:58:41,781 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,781 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,781 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1476 1478) the Hoare annotation is: true [2018-01-20 23:58:41,781 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1476 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,781 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1476 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,781 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1476 1478) no Hoare annotation was computed. [2018-01-20 23:58:41,781 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1468 1474) the Hoare annotation is: true [2018-01-20 23:58:41,781 INFO L401 ceAbstractionStarter]: For program point L1469(line 1469) no Hoare annotation was computed. [2018-01-20 23:58:41,782 INFO L401 ceAbstractionStarter]: For program point L1470'(lines 1470 1472) no Hoare annotation was computed. [2018-01-20 23:58:41,782 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1468 1474) no Hoare annotation was computed. [2018-01-20 23:58:41,782 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1468 1474) no Hoare annotation was computed. [2018-01-20 23:58:41,782 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1468 1474) no Hoare annotation was computed. [2018-01-20 23:58:41,782 INFO L401 ceAbstractionStarter]: For program point L1470(lines 1470 1472) no Hoare annotation was computed. [2018-01-20 23:58:41,782 INFO L404 ceAbstractionStarter]: At program point L1471(line 1471) the Hoare annotation is: true [2018-01-20 23:58:41,782 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-20 23:58:41,783 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-20 23:58:41,783 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-20 23:58:41,783 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-20 23:58:41,783 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-20 23:58:41,783 INFO L404 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: true [2018-01-20 23:58:41,783 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-20 23:58:41,783 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-20 23:58:41,783 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-20 23:58:41,783 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-20 23:58:41,783 INFO L404 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: true [2018-01-20 23:58:41,784 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-20 23:58:41,784 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0EnsuresViolation(lines 1442 1459) no Hoare annotation was computed. [2018-01-20 23:58:41,784 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-20 23:58:41,784 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-20 23:58:41,784 INFO L404 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: true [2018-01-20 23:58:41,784 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-20 23:58:41,784 INFO L404 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: true [2018-01-20 23:58:41,784 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-20 23:58:41,785 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-20 23:58:41,785 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-20 23:58:41,787 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:41,787 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:41,787 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:41,788 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:41,788 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:41,788 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:41,788 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:41,788 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:58:41,788 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-20 23:58:41,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:41,791 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-20 23:58:41,791 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:58:41,791 INFO L82 PathProgramCache]: Analyzing trace with hash 94754281, now seen corresponding path program 1 times [2018-01-20 23:58:41,791 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:41,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:41,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:41,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:41,794 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:58:41,830 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:58:41,836 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:58:41,841 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-20 23:58:41,841 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-20 23:58:41,842 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-20 23:58:41,842 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-20 23:58:41,847 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:41,848 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:41,848 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:41,848 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:41,848 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:41,848 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:41,848 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:41,848 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_2_6Err0EnsuresViolation======== [2018-01-20 23:58:41,848 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 23:58:41,851 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:41,852 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:58:41,852 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_2_6Err0EnsuresViolation]=== [2018-01-20 23:58:41,852 INFO L82 PathProgramCache]: Analyzing trace with hash 667995110, now seen corresponding path program 1 times [2018-01-20 23:58:41,852 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:41,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:41,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:41,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:41,854 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:41,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:58:42,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:42,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:58:42,029 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:42,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:58:42,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:58:42,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:42,030 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-20 23:58:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:42,051 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-20 23:58:42,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:58:42,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-20 23:58:42,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:42,052 INFO L225 Difference]: With dead ends: 59 [2018-01-20 23:58:42,052 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:42,052 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:42,053 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-20 23:58:42,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:42,054 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:42,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:58:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:42,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:42,056 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:42,056 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:42,056 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:42,056 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:42,056 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:42,056 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:42,057 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:42,057 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:58:42,057 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:42,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 23:58:42,060 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:42,060 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-20 23:58:42,060 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:58:42,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1044480613, now seen corresponding path program 1 times [2018-01-20 23:58:42,061 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:42,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:42,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:42,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:42,063 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:42,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:58:42,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:42,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:58:42,169 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:42,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:58:42,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:58:42,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:42,170 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-20 23:58:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:42,190 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-20 23:58:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:58:42,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-20 23:58:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:42,191 INFO L225 Difference]: With dead ends: 59 [2018-01-20 23:58:42,191 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:42,192 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:42,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-20 23:58:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:42,193 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:42,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:58:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:42,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:42,195 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:42,195 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:42,195 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:42,195 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:42,195 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:42,195 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:42,195 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:42,196 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:58:42,196 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 23:58:42,198 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:42,198 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-20 23:58:42,199 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:58:42,199 INFO L82 PathProgramCache]: Analyzing trace with hash -765331831, now seen corresponding path program 1 times [2018-01-20 23:58:42,199 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:42,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:42,200 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:42,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:42,201 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:42,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:58:42,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:42,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:58:42,273 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:42,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:58:42,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:58:42,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:42,274 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-20 23:58:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:42,307 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-20 23:58:42,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:58:42,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-20 23:58:42,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:42,308 INFO L225 Difference]: With dead ends: 59 [2018-01-20 23:58:42,308 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:42,309 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:42,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-20 23:58:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:42,310 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:42,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:58:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:42,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:42,312 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:42,312 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:42,312 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:42,312 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:42,312 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:42,312 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:42,312 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:42,313 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-20 23:58:42,313 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 23:58:42,315 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:42,315 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-20 23:58:42,315 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 23:58:42,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1641018034, now seen corresponding path program 1 times [2018-01-20 23:58:42,316 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:42,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:42,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:42,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:42,317 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:42,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:58:42,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:42,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:58:42,385 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:42,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:58:42,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:58:42,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:42,386 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-20 23:58:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:42,413 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-20 23:58:42,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:58:42,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-20 23:58:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:42,414 INFO L225 Difference]: With dead ends: 59 [2018-01-20 23:58:42,414 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:42,415 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:42,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:42,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:42,415 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-20 23:58:42,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:42,416 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:42,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:58:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:42,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:42,417 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:42,417 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:42,417 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:42,417 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:42,417 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:42,417 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:42,417 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:42,417 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == g6Err0EnsuresViolation======== [2018-01-20 23:58:42,418 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 23:58:42,419 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:42,419 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:58:42,419 INFO L371 AbstractCegarLoop]: === Iteration 1 === [g6Err0EnsuresViolation]=== [2018-01-20 23:58:42,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2049483698, now seen corresponding path program 1 times [2018-01-20 23:58:42,420 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:42,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:42,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:42,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:42,421 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:42,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:58:42,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:42,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:58:42,485 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:42,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:58:42,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:58:42,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:42,486 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-20 23:58:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:42,499 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-20 23:58:42,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:58:42,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-20 23:58:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:42,500 INFO L225 Difference]: With dead ends: 59 [2018-01-20 23:58:42,500 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:42,500 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:42,501 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-20 23:58:42,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:42,501 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:42,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:58:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:42,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:42,502 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:58:42,502 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:58:42,502 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:58:42,502 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:58:42,503 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:58:42,503 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:58:42,503 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:58:42,503 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe1_6Err0EnsuresViolation======== [2018-01-20 23:58:42,503 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:58:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-20 23:58:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 23:58:42,505 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:58:42,505 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:58:42,505 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe1_6Err0EnsuresViolation]=== [2018-01-20 23:58:42,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1705793529, now seen corresponding path program 1 times [2018-01-20 23:58:42,505 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:58:42,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:42,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:58:42,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:58:42,507 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:58:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:58:42,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:58:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:58:42,566 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:58:42,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:58:42,566 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:58:42,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:58:42,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:58:42,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:42,567 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-20 23:58:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:58:42,587 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-20 23:58:42,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:58:42,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-20 23:58:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:58:42,589 INFO L225 Difference]: With dead ends: 59 [2018-01-20 23:58:42,589 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:58:42,590 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:58:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:58:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:58:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:58:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:58:42,591 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-01-20 23:58:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:58:42,591 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:58:42,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:58:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:58:42,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:58:42,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:58:42 BoogieIcfgContainer [2018-01-20 23:58:42,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:58:42,595 INFO L168 Benchmark]: Toolchain (without parser) took 2214.23 ms. Allocated memory was 302.5 MB in the beginning and 457.2 MB in the end (delta: 154.7 MB). Free memory was 261.4 MB in the beginning and 313.1 MB in the end (delta: -51.7 MB). Peak memory consumption was 103.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:58:42,596 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:58:42,597 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.17 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 247.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-20 23:58:42,597 INFO L168 Benchmark]: Boogie Preprocessor took 31.52 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:58:42,597 INFO L168 Benchmark]: RCFGBuilder took 273.61 ms. Allocated memory is still 302.5 MB. Free memory was 245.5 MB in the beginning and 226.6 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. [2018-01-20 23:58:42,598 INFO L168 Benchmark]: TraceAbstraction took 1688.24 ms. Allocated memory was 302.5 MB in the beginning and 457.2 MB in the end (delta: 154.7 MB). Free memory was 226.6 MB in the beginning and 313.1 MB in the end (delta: -86.6 MB). Peak memory consumption was 68.1 MB. Max. memory is 5.3 GB. [2018-01-20 23:58:42,600 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.14 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.17 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 247.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.52 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 245.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 273.61 ms. Allocated memory is still 302.5 MB. Free memory was 245.5 MB in the beginning and 226.6 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1688.24 ms. Allocated memory was 302.5 MB in the beginning and 457.2 MB in the end (delta: 154.7 MB). Free memory was 226.6 MB in the beginning and 313.1 MB in the end (delta: -86.6 MB). Peak memory consumption was 68.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# * 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: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=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, 15 LocationsWithAnnotation, 15 PreInvPairs, 15 NumberOfFragments, 17 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1072]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 9 procedures, 59 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=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, 15 LocationsWithAnnotation, 15 PreInvPairs, 15 NumberOfFragments, 17 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1465] FCALL struct A a6; VAL [\old(a6)=null, \old(a6)=null, a6={7:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 9 procedures, 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, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 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.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.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: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 1288 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: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 9 procedures, 59 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=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, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1476]: 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: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=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, 1368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1468]: 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.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 12 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=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, 1210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 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.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=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, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 1450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - 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.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=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, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 850 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - 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_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-58-42-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-58-42-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-58-42-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-58-42-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-58-42-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_23-58-42-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_23-58-42-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-20_23-58-42-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-20_23-58-42-612.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-20_23-58-42-612.csv Received shutdown request...