java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 06:15:07,521 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 06:15:07,523 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 06:15:07,541 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 06:15:07,541 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 06:15:07,542 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 06:15:07,544 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 06:15:07,546 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 06:15:07,548 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 06:15:07,549 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 06:15:07,550 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 06:15:07,551 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 06:15:07,552 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 06:15:07,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 06:15:07,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 06:15:07,564 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 06:15:07,566 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 06:15:07,568 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 06:15:07,569 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 06:15:07,570 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 06:15:07,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 06:15:07,578 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 06:15:07,578 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 06:15:07,579 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 06:15:07,586 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 06:15:07,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 06:15:07,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 06:15:07,589 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 06:15:07,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 06:15:07,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 06:15:07,590 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 06:15:07,590 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-21 06:15:07,609 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 06:15:07,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 06:15:07,610 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 06:15:07,611 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 06:15:07,611 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 06:15:07,611 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 06:15:07,611 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 06:15:07,612 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 06:15:07,612 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 06:15:07,612 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 06:15:07,613 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 06:15:07,613 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 06:15:07,613 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 06:15:07,614 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 06:15:07,614 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 06:15:07,614 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 06:15:07,614 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 06:15:07,614 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 06:15:07,614 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 06:15:07,615 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 06:15:07,615 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 06:15:07,615 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 06:15:07,615 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 06:15:07,615 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 06:15:07,616 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 06:15:07,616 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 06:15:07,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 06:15:07,616 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 06:15:07,616 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 06:15:07,617 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 06:15:07,617 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 06:15:07,617 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 06:15:07,617 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 06:15:07,617 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 06:15:07,618 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 06:15:07,618 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 06:15:07,618 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 06:15:07,619 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 06:15:07,619 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 06:15:07,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 06:15:07,691 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 06:15:07,695 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 06:15:07,697 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 06:15:07,698 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 06:15:07,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i [2018-01-21 06:15:07,957 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 06:15:07,962 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 06:15:07,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 06:15:07,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 06:15:07,971 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 06:15:07,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 06:15:07" (1/1) ... [2018-01-21 06:15:07,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4b3da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:15:07, skipping insertion in model container [2018-01-21 06:15:07,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 06:15:07" (1/1) ... [2018-01-21 06:15:07,997 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 06:15:08,064 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 06:15:08,178 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 06:15:08,195 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 06:15:08,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:15:08 WrapperNode [2018-01-21 06:15:08,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 06:15:08,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 06:15:08,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 06:15:08,205 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 06:15:08,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:15:08" (1/1) ... [2018-01-21 06:15:08,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:15:08" (1/1) ... [2018-01-21 06:15:08,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:15:08" (1/1) ... [2018-01-21 06:15:08,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:15:08" (1/1) ... [2018-01-21 06:15:08,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:15:08" (1/1) ... [2018-01-21 06:15:08,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:15:08" (1/1) ... [2018-01-21 06:15:08,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:15:08" (1/1) ... [2018-01-21 06:15:08,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 06:15:08,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 06:15:08,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 06:15:08,274 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 06:15:08,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:15:08" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 06:15:08,324 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 06:15:08,324 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 06:15:08,324 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 06:15:08,325 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-21 06:15:08,325 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-21 06:15:08,325 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-21 06:15:08,325 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-21 06:15:08,325 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 06:15:08,325 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 06:15:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 06:15:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 06:15:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 06:15:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 06:15:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 06:15:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 06:15:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 06:15:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 06:15:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 06:15:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-21 06:15:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-21 06:15:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-21 06:15:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-21 06:15:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 06:15:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 06:15:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 06:15:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 06:15:08,527 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 06:15:08,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 06:15:08 BoogieIcfgContainer [2018-01-21 06:15:08,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 06:15:08,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 06:15:08,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 06:15:08,530 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 06:15:08,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 06:15:07" (1/3) ... [2018-01-21 06:15:08,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a096daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 06:15:08, skipping insertion in model container [2018-01-21 06:15:08,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 06:15:08" (2/3) ... [2018-01-21 06:15:08,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a096daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 06:15:08, skipping insertion in model container [2018-01-21 06:15:08,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 06:15:08" (3/3) ... [2018-01-21 06:15:08,534 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test7_true-valid-memsafety_true-termination.i [2018-01-21 06:15:08,545 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 06:15:08,552 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-21 06:15:08,604 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:15:08,604 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:15:08,605 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:15:08,605 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:15:08,605 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:15:08,605 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:15:08,605 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:15:08,605 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f6Err0EnsuresViolation======== [2018-01-21 06:15:08,606 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:15:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 06:15:08,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 06:15:08,637 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:08,638 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:08,638 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f6Err0EnsuresViolation]=== [2018-01-21 06:15:08,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1141227672, now seen corresponding path program 1 times [2018-01-21 06:15:08,646 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:08,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:08,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:08,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:08,704 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:15:08,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:15:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:15:08,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:15:08,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 06:15:08,947 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:15:08,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 06:15:08,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 06:15:08,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:15:08,962 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-01-21 06:15:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:15:09,084 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-01-21 06:15:09,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 06:15:09,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-21 06:15:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:15:09,092 INFO L225 Difference]: With dead ends: 110 [2018-01-21 06:15:09,092 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:15:09,097 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:15:09,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:15:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:15:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:15:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:15:09,119 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-01-21 06:15:09,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:15:09,119 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:15:09,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 06:15:09,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:15:09,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:15:09,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 06:15:09,171 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-21 06:15:09,172 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 06:15:09,172 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 06:15:09,172 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 06:15:09,172 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 06:15:09,172 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 06:15:09,172 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 06:15:09,172 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 06:15:09,173 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 06:15:09,173 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 06:15:09,173 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 06:15:09,173 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-21 06:15:09,173 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1476) no Hoare annotation was computed. [2018-01-21 06:15:09,173 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1476) the Hoare annotation is: true [2018-01-21 06:15:09,174 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1476) no Hoare annotation was computed. [2018-01-21 06:15:09,174 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1476) the Hoare annotation is: true [2018-01-21 06:15:09,174 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1476) no Hoare annotation was computed. [2018-01-21 06:15:09,174 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1476) the Hoare annotation is: true [2018-01-21 06:15:09,174 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-21 06:15:09,174 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1476) no Hoare annotation was computed. [2018-01-21 06:15:09,175 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1474 1476) the Hoare annotation is: true [2018-01-21 06:15:09,175 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1474 1476) no Hoare annotation was computed. [2018-01-21 06:15:09,175 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1474 1476) no Hoare annotation was computed. [2018-01-21 06:15:09,175 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1474 1476) no Hoare annotation was computed. [2018-01-21 06:15:09,175 INFO L404 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1461 1463) the Hoare annotation is: true [2018-01-21 06:15:09,175 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err0EnsuresViolation(lines 1461 1463) no Hoare annotation was computed. [2018-01-21 06:15:09,176 INFO L401 ceAbstractionStarter]: For program point L1462''(line 1462) no Hoare annotation was computed. [2018-01-21 06:15:09,176 INFO L401 ceAbstractionStarter]: For program point L1462'(line 1462) no Hoare annotation was computed. [2018-01-21 06:15:09,176 INFO L401 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1461 1463) no Hoare annotation was computed. [2018-01-21 06:15:09,176 INFO L401 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1461 1463) no Hoare annotation was computed. [2018-01-21 06:15:09,176 INFO L401 ceAbstractionStarter]: For program point L1462(line 1462) no Hoare annotation was computed. [2018-01-21 06:15:09,176 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1466 1472) no Hoare annotation was computed. [2018-01-21 06:15:09,176 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1466 1472) no Hoare annotation was computed. [2018-01-21 06:15:09,176 INFO L401 ceAbstractionStarter]: For program point L1467'(line 1467) no Hoare annotation was computed. [2018-01-21 06:15:09,177 INFO L404 ceAbstractionStarter]: At program point L1470(line 1470) the Hoare annotation is: true [2018-01-21 06:15:09,177 INFO L401 ceAbstractionStarter]: For program point L1469'(lines 1469 1471) no Hoare annotation was computed. [2018-01-21 06:15:09,177 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1466 1472) the Hoare annotation is: true [2018-01-21 06:15:09,177 INFO L401 ceAbstractionStarter]: For program point L1469(lines 1469 1471) no Hoare annotation was computed. [2018-01-21 06:15:09,177 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1466 1472) no Hoare annotation was computed. [2018-01-21 06:15:09,177 INFO L404 ceAbstractionStarter]: At program point L1467(line 1467) the Hoare annotation is: true [2018-01-21 06:15:09,178 INFO L401 ceAbstractionStarter]: For program point L1468(line 1468) no Hoare annotation was computed. [2018-01-21 06:15:09,178 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 06:15:09,178 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 06:15:09,178 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-21 06:15:09,178 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 06:15:09,178 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-21 06:15:09,179 INFO L404 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: true [2018-01-21 06:15:09,179 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-21 06:15:09,179 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-21 06:15:09,179 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-21 06:15:09,179 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-21 06:15:09,179 INFO L404 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: true [2018-01-21 06:15:09,179 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-21 06:15:09,180 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0EnsuresViolation(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 06:15:09,180 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-21 06:15:09,180 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-21 06:15:09,180 INFO L404 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: true [2018-01-21 06:15:09,180 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 06:15:09,180 INFO L404 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: true [2018-01-21 06:15:09,181 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-21 06:15:09,181 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-21 06:15:09,181 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 06:15:09,185 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:15:09,185 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:15:09,185 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:15:09,185 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:15:09,185 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:15:09,185 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:15:09,186 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:15:09,186 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 06:15:09,186 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:15:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 06:15:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 06:15:09,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:09,189 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:09,190 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 06:15:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash 670629914, now seen corresponding path program 1 times [2018-01-21 06:15:09,190 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:09,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:09,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,193 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:15:09,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:15:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:15:09,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:15:09,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:15:09,235 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:15:09,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 06:15:09,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 06:15:09,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:15:09,236 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-21 06:15:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:15:09,316 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-21 06:15:09,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 06:15:09,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-21 06:15:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:15:09,318 INFO L225 Difference]: With dead ends: 66 [2018-01-21 06:15:09,318 INFO L226 Difference]: Without dead ends: 16 [2018-01-21 06:15:09,319 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:15:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-01-21 06:15:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-01-21 06:15:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-01-21 06:15:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-01-21 06:15:09,329 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 13 [2018-01-21 06:15:09,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:15:09,329 INFO L432 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-01-21 06:15:09,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 06:15:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-01-21 06:15:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 06:15:09,330 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:09,330 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:09,330 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 06:15:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash 230160188, now seen corresponding path program 1 times [2018-01-21 06:15:09,331 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:09,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:09,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,332 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:15:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:15:09,394 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 06:15:09,402 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:15:09,404 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:15:09,414 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:15:09,414 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:15:09,414 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:15:09,414 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:15:09,414 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:15:09,414 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:15:09,414 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:15:09,414 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 06:15:09,415 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:15:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 06:15:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 06:15:09,416 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:09,416 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 06:15:09,416 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 06:15:09,416 INFO L82 PathProgramCache]: Analyzing trace with hash 101483, now seen corresponding path program 1 times [2018-01-21 06:15:09,417 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:09,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:09,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,418 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:15:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:15:09,424 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 06:15:09,424 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:15:09,426 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:15:09,426 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:15:09,426 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:15:09,426 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:15:09,426 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:15:09,426 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:15:09,426 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:15:09,426 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 06:15:09,426 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:15:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 06:15:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 06:15:09,429 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:09,429 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:09,429 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 06:15:09,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1487692289, now seen corresponding path program 1 times [2018-01-21 06:15:09,429 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:09,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:09,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,431 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:15:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 06:15:09,467 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 06:15:09,470 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:15:09,471 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:15:09,471 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:15:09,472 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:15:09,472 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:15:09,472 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 06:15:09,475 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:15:09,475 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:15:09,475 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:15:09,476 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:15:09,476 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:15:09,476 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:15:09,476 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:15:09,476 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 06:15:09,476 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:15:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 06:15:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 06:15:09,478 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:09,478 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:09,479 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 06:15:09,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2146797079, now seen corresponding path program 1 times [2018-01-21 06:15:09,479 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:09,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:09,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,481 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:15:09,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:15:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:15:09,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:15:09,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:15:09,534 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:15:09,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 06:15:09,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 06:15:09,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:15:09,535 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-21 06:15:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:15:09,606 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-21 06:15:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 06:15:09,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-21 06:15:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:15:09,607 INFO L225 Difference]: With dead ends: 66 [2018-01-21 06:15:09,608 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:15:09,608 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:15:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:15:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:15:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:15:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:15:09,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 06:15:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:15:09,609 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:15:09,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 06:15:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:15:09,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:15:09,612 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:15:09,612 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:15:09,612 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:15:09,612 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:15:09,613 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:15:09,613 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:15:09,613 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:15:09,613 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_6Err0EnsuresViolation======== [2018-01-21 06:15:09,613 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:15:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 06:15:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 06:15:09,616 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:09,616 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:09,616 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_6Err0EnsuresViolation]=== [2018-01-21 06:15:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash 563976181, now seen corresponding path program 1 times [2018-01-21 06:15:09,617 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:09,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:09,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,619 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:15:09,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:15:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:15:09,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:15:09,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 06:15:09,683 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:15:09,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 06:15:09,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 06:15:09,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 06:15:09,684 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 06:15:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:15:09,730 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-01-21 06:15:09,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 06:15:09,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-21 06:15:09,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:15:09,731 INFO L225 Difference]: With dead ends: 91 [2018-01-21 06:15:09,732 INFO L226 Difference]: Without dead ends: 45 [2018-01-21 06:15:09,732 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-21 06:15:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-21 06:15:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-21 06:15:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 06:15:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-01-21 06:15:09,739 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 26 [2018-01-21 06:15:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:15:09,740 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-01-21 06:15:09,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 06:15:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-01-21 06:15:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 06:15:09,741 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:09,741 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:09,742 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_6Err0EnsuresViolation]=== [2018-01-21 06:15:09,742 INFO L82 PathProgramCache]: Analyzing trace with hash -493276934, now seen corresponding path program 1 times [2018-01-21 06:15:09,742 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:09,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:09,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,744 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:15:09,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:15:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:15:09,800 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:15:09,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 06:15:09,800 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:15:09,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 06:15:09,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 06:15:09,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:15:09,801 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 5 states. [2018-01-21 06:15:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:15:09,816 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-21 06:15:09,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 06:15:09,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-21 06:15:09,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:15:09,818 INFO L225 Difference]: With dead ends: 76 [2018-01-21 06:15:09,818 INFO L226 Difference]: Without dead ends: 45 [2018-01-21 06:15:09,819 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:15:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-21 06:15:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-21 06:15:09,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 06:15:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-01-21 06:15:09,824 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 34 [2018-01-21 06:15:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:15:09,824 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-01-21 06:15:09,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 06:15:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-01-21 06:15:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-21 06:15:09,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:09,825 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:09,825 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_6Err0EnsuresViolation]=== [2018-01-21 06:15:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash -2073205992, now seen corresponding path program 1 times [2018-01-21 06:15:09,826 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:09,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:09,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,828 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:15:09,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:15:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:15:09,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:15:09,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 06:15:09,883 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:15:09,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 06:15:09,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 06:15:09,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:15:09,884 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 4 states. [2018-01-21 06:15:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:15:09,921 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-01-21 06:15:09,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 06:15:09,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-21 06:15:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:15:09,922 INFO L225 Difference]: With dead ends: 45 [2018-01-21 06:15:09,922 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:15:09,923 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:15:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:15:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:15:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:15:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:15:09,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-01-21 06:15:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:15:09,924 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:15:09,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 06:15:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:15:09,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:15:09,927 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:15:09,927 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:15:09,927 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:15:09,927 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:15:09,927 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:15:09,927 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:15:09,927 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:15:09,928 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 06:15:09,928 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:15:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 06:15:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 06:15:09,930 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:09,930 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:09,931 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 06:15:09,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2062568257, now seen corresponding path program 1 times [2018-01-21 06:15:09,931 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:09,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:09,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:09,933 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:15:09,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:15:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:15:10,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:15:10,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 06:15:10,026 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:15:10,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 06:15:10,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 06:15:10,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:15:10,027 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 4 states. [2018-01-21 06:15:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:15:10,142 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-21 06:15:10,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 06:15:10,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-21 06:15:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:15:10,144 INFO L225 Difference]: With dead ends: 66 [2018-01-21 06:15:10,144 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:15:10,144 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:15:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:15:10,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:15:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:15:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:15:10,146 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 06:15:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:15:10,146 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:15:10,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 06:15:10,146 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:15:10,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:15:10,148 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:15:10,148 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:15:10,149 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:15:10,149 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:15:10,149 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:15:10,149 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:15:10,149 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:15:10,149 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == g6Err0EnsuresViolation======== [2018-01-21 06:15:10,149 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:15:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 06:15:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 06:15:10,152 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:10,152 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:10,152 INFO L371 AbstractCegarLoop]: === Iteration 1 === [g6Err0EnsuresViolation]=== [2018-01-21 06:15:10,152 INFO L82 PathProgramCache]: Analyzing trace with hash -527098219, now seen corresponding path program 1 times [2018-01-21 06:15:10,152 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:10,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:10,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:10,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:10,154 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:15:10,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:15:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:15:10,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:15:10,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 06:15:10,223 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:15:10,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 06:15:10,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 06:15:10,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:15:10,224 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-01-21 06:15:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:15:10,258 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-01-21 06:15:10,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 06:15:10,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-21 06:15:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:15:10,259 INFO L225 Difference]: With dead ends: 110 [2018-01-21 06:15:10,259 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:15:10,260 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:15:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:15:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:15:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:15:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:15:10,261 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 06:15:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:15:10,261 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:15:10,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 06:15:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:15:10,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:15:10,263 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 06:15:10,263 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 06:15:10,264 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 06:15:10,264 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 06:15:10,264 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 06:15:10,264 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 06:15:10,264 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 06:15:10,264 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe1_6Err0EnsuresViolation======== [2018-01-21 06:15:10,264 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 06:15:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 06:15:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 06:15:10,266 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:10,266 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:10,267 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe1_6Err0EnsuresViolation]=== [2018-01-21 06:15:10,267 INFO L82 PathProgramCache]: Analyzing trace with hash -2063614678, now seen corresponding path program 1 times [2018-01-21 06:15:10,267 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:10,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:10,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:10,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:10,269 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:15:10,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:15:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:15:10,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:15:10,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 06:15:10,295 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:15:10,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 06:15:10,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 06:15:10,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:15:10,296 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-21 06:15:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:15:10,372 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-21 06:15:10,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 06:15:10,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 06:15:10,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:15:10,374 INFO L225 Difference]: With dead ends: 66 [2018-01-21 06:15:10,374 INFO L226 Difference]: Without dead ends: 35 [2018-01-21 06:15:10,374 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 06:15:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-21 06:15:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-01-21 06:15:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-21 06:15:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-21 06:15:10,378 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 17 [2018-01-21 06:15:10,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:15:10,379 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-21 06:15:10,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 06:15:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-21 06:15:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 06:15:10,379 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:10,379 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:10,380 INFO L371 AbstractCegarLoop]: === Iteration 2 === [probe1_6Err0EnsuresViolation]=== [2018-01-21 06:15:10,380 INFO L82 PathProgramCache]: Analyzing trace with hash -527172987, now seen corresponding path program 1 times [2018-01-21 06:15:10,380 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:10,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:10,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:10,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:10,381 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:15:10,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:15:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:15:10,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:15:10,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 06:15:10,478 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:15:10,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 06:15:10,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 06:15:10,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:15:10,479 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 5 states. [2018-01-21 06:15:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:15:10,494 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-21 06:15:10,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 06:15:10,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-21 06:15:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:15:10,495 INFO L225 Difference]: With dead ends: 54 [2018-01-21 06:15:10,495 INFO L226 Difference]: Without dead ends: 34 [2018-01-21 06:15:10,497 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 06:15:10,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-21 06:15:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-21 06:15:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-21 06:15:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-01-21 06:15:10,503 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 25 [2018-01-21 06:15:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:15:10,504 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-01-21 06:15:10,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 06:15:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-01-21 06:15:10,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 06:15:10,505 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 06:15:10,505 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 06:15:10,505 INFO L371 AbstractCegarLoop]: === Iteration 3 === [probe1_6Err0EnsuresViolation]=== [2018-01-21 06:15:10,505 INFO L82 PathProgramCache]: Analyzing trace with hash 838815399, now seen corresponding path program 1 times [2018-01-21 06:15:10,505 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 06:15:10,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:10,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 06:15:10,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 06:15:10,507 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 06:15:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 06:15:10,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 06:15:10,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 06:15:10,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 06:15:10,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 06:15:10,542 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 06:15:10,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 06:15:10,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 06:15:10,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:15:10,543 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 4 states. [2018-01-21 06:15:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 06:15:10,569 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-01-21 06:15:10,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 06:15:10,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-21 06:15:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 06:15:10,570 INFO L225 Difference]: With dead ends: 34 [2018-01-21 06:15:10,570 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 06:15:10,570 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 06:15:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 06:15:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 06:15:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 06:15:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 06:15:10,571 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 06:15:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 06:15:10,571 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 06:15:10,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 06:15:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 06:15:10,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 06:15:10,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 06:15:10 BoogieIcfgContainer [2018-01-21 06:15:10,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 06:15:10,575 INFO L168 Benchmark]: Toolchain (without parser) took 2617.79 ms. Allocated memory was 300.4 MB in the beginning and 473.4 MB in the end (delta: 173.0 MB). Free memory was 257.7 MB in the beginning and 399.3 MB in the end (delta: -141.6 MB). Peak memory consumption was 31.4 MB. Max. memory is 5.3 GB. [2018-01-21 06:15:10,576 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 300.4 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 06:15:10,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.52 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 244.8 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-21 06:15:10,577 INFO L168 Benchmark]: Boogie Preprocessor took 69.14 ms. Allocated memory is still 300.4 MB. Free memory was 244.8 MB in the beginning and 242.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 06:15:10,577 INFO L168 Benchmark]: RCFGBuilder took 253.71 ms. Allocated memory is still 300.4 MB. Free memory was 242.8 MB in the beginning and 224.1 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. [2018-01-21 06:15:10,577 INFO L168 Benchmark]: TraceAbstraction took 2046.00 ms. Allocated memory was 300.4 MB in the beginning and 473.4 MB in the end (delta: 173.0 MB). Free memory was 224.1 MB in the beginning and 399.3 MB in the end (delta: -175.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 06:15:10,578 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.30 ms. Allocated memory is still 300.4 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 240.52 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 244.8 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 69.14 ms. Allocated memory is still 300.4 MB. Free memory was 244.8 MB in the beginning and 242.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 253.71 ms. Allocated memory is still 300.4 MB. Free memory was 242.8 MB in the beginning and 224.1 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2046.00 ms. Allocated memory was 300.4 MB in the beginning and 473.4 MB in the end (delta: 173.0 MB). Free memory was 224.1 MB in the beginning and 399.3 MB in the end (delta: -175.2 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1434]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: f6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 4 SDslu, 181 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 19 PreInvPairs, 23 NumberOfFragments, 16 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1475] CALL entry_point() [L1467] FCALL struct A a7; VAL [a7={7:0}] [L1468] CALL probe1_6(&a7) VAL [a={7:0}] [L1443] int ret = - -3; VAL [a={7:0}, a={7:0}, ret=3] [L1444] CALL ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={6:0}, size=4] [L1074] return malloc(size); VAL [\old(size)=4, \result={6:0}, malloc(size)={6:0}, size=4] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 22 SDslu, 7 SDs, 0 SdLazy, 28 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1475] CALL entry_point() [L1467] FCALL struct A a7; VAL [a7={6:0}] [L1468] CALL, EXPR probe1_6(&a7) VAL [a={6:0}] [L1443] int ret = - -3; VAL [a={6:0}, a={6:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=4, \result={0:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={6:0}, a={6:0}, ldv_malloc(sizeof(int))={0:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND TRUE p==0 [L1446] RET return ret; VAL [\result=3, a={6:0}, a={6:0}, p={0:0}, ret=3] [L1468] EXPR probe1_6(&a7) VAL [a7={6:0}, probe1_6(&a7)=3] [L1468] int ret = probe1_6(&a7); [L1469] COND FALSE, RET !(ret==0) VAL [a7={6:0}, ret=3] [L1475] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1474]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 51 SDtfs, 24 SDslu, 7 SDs, 0 SdLazy, 28 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 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_6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 118 SDtfs, 11 SDslu, 366 SDs, 0 SdLazy, 46 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 4501 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1466]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: entry_pointErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 46 SDtfs, 19 SDslu, 26 SDs, 0 SdLazy, 65 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 1540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1438]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: g6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 4 SDslu, 181 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 1152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1442]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: probe1_6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 96 SDtfs, 19 SDslu, 109 SDs, 0 SdLazy, 50 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 2684 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 1452]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_06-15-10-590.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_06-15-10-590.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_06-15-10-590.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_06-15-10-590.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_06-15-10-590.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_06-15-10-590.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_06-15-10-590.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_06-15-10-590.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_06-15-10-590.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-21_06-15-10-590.csv Received shutdown request...