java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:59:47,377 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:59:47,379 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:59:47,394 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:59:47,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:59:47,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:59:47,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:59:47,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:59:47,399 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:59:47,400 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:59:47,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:59:47,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:59:47,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:59:47,402 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:59:47,403 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:59:47,405 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:59:47,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:59:47,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:59:47,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:59:47,413 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:59:47,415 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:59:47,415 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:59:47,416 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:59:47,417 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:59:47,417 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:59:47,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:59:47,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:59:47,420 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:59:47,420 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:59:47,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:59:47,421 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:59:47,421 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-20 23:59:47,431 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:59:47,432 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:59:47,433 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:59:47,433 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:59:47,433 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:59:47,433 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:59:47,434 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:59:47,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:59:47,435 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:59:47,435 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:59:47,435 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:59:47,435 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:59:47,435 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:59:47,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:59:47,436 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:59:47,436 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:59:47,436 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:59:47,436 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:59:47,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:59:47,437 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:59:47,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:59:47,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:59:47,437 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:59:47,438 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:59:47,438 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:59:47,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:59:47,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:59:47,438 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:59:47,439 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:59:47,439 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:59:47,439 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:59:47,439 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:59:47,439 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:59:47,440 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:59:47,440 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:59:47,440 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:59:47,441 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:59:47,441 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:59:47,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:59:47,490 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:59:47,494 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:59:47,496 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:59:47,496 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:59:47,497 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-20 23:59:47,684 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:59:47,690 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:59:47,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:59:47,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:59:47,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:59:47,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:59:47" (1/1) ... [2018-01-20 23:59:47,701 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 20.01 11:59:47, skipping insertion in model container [2018-01-20 23:59:47,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:59:47" (1/1) ... [2018-01-20 23:59:47,721 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:59:47,776 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:59:47,895 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:59:47,911 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:59:47,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:47 WrapperNode [2018-01-20 23:59:47,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:59:47,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:59:47,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:59:47,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:59:47,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:47" (1/1) ... [2018-01-20 23:59:47,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:47" (1/1) ... [2018-01-20 23:59:47,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:47" (1/1) ... [2018-01-20 23:59:47,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:47" (1/1) ... [2018-01-20 23:59:47,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:47" (1/1) ... [2018-01-20 23:59:47,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:47" (1/1) ... [2018-01-20 23:59:47,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:47" (1/1) ... [2018-01-20 23:59:47,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:59:47,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:59:47,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:59:47,959 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:59:47,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:47" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:59:48,008 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:59:48,008 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:59:48,008 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-20 23:59:48,008 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-20 23:59:48,008 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-20 23:59:48,008 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-20 23:59:48,009 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-20 23:59:48,009 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-20 23:59:48,009 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:59:48,009 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 23:59:48,009 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 23:59:48,009 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:59:48,009 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:59:48,009 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:59:48,009 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:59:48,009 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:59:48,010 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:59:48,010 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-20 23:59:48,010 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-20 23:59:48,010 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-20 23:59:48,010 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-20 23:59:48,010 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-20 23:59:48,010 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-20 23:59:48,010 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:59:48,010 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:59:48,010 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:59:48,235 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:59:48,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:59:48 BoogieIcfgContainer [2018-01-20 23:59:48,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:59:48,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:59:48,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:59:48,238 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:59:48,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:59:47" (1/3) ... [2018-01-20 23:59:48,239 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 20.01 11:59:48, skipping insertion in model container [2018-01-20 23:59:48,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:59:47" (2/3) ... [2018-01-20 23:59:48,239 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 20.01 11:59:48, skipping insertion in model container [2018-01-20 23:59:48,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:59:48" (3/3) ... [2018-01-20 23:59:48,241 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test7_true-valid-memsafety_true-termination.i [2018-01-20 23:59:48,247 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:59:48,254 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-20 23:59:48,295 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:48,295 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:48,295 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:48,295 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:48,295 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:48,295 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:48,296 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:48,296 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f6Err0EnsuresViolation======== [2018-01-20 23:59:48,296 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 23:59:48,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 23:59:48,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:48,323 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:48,323 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f6Err0EnsuresViolation]=== [2018-01-20 23:59:48,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1141227672, now seen corresponding path program 1 times [2018-01-20 23:59:48,329 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:48,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:48,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:48,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:48,378 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:48,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:48,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:48,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:59:48,632 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:48,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:59:48,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:59:48,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:48,721 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-01-20 23:59:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:48,785 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-01-20 23:59:48,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:59:48,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-20 23:59:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:48,793 INFO L225 Difference]: With dead ends: 110 [2018-01-20 23:59:48,793 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:48,796 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-20 23:59:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:48,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-01-20 23:59:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:48,819 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:48,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:59:48,820 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:48,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:48,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-20 23:59:48,880 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-20 23:59:48,880 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-20 23:59:48,881 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-20 23:59:48,881 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-20 23:59:48,881 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-20 23:59:48,881 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-20 23:59:48,881 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-20 23:59:48,881 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:59:48,881 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:59:48,881 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-20 23:59:48,881 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-20 23:59:48,881 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-20 23:59:48,881 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1476) no Hoare annotation was computed. [2018-01-20 23:59:48,882 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1476) the Hoare annotation is: true [2018-01-20 23:59:48,882 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1476) no Hoare annotation was computed. [2018-01-20 23:59:48,882 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1476) the Hoare annotation is: true [2018-01-20 23:59:48,882 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1476) no Hoare annotation was computed. [2018-01-20 23:59:48,882 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1476) the Hoare annotation is: true [2018-01-20 23:59:48,882 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1476) no Hoare annotation was computed. [2018-01-20 23:59:48,882 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1476) no Hoare annotation was computed. [2018-01-20 23:59:48,882 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1474 1476) the Hoare annotation is: true [2018-01-20 23:59:48,882 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1474 1476) no Hoare annotation was computed. [2018-01-20 23:59:48,882 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1474 1476) no Hoare annotation was computed. [2018-01-20 23:59:48,883 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1474 1476) no Hoare annotation was computed. [2018-01-20 23:59:48,883 INFO L404 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1461 1463) the Hoare annotation is: true [2018-01-20 23:59:48,883 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err0EnsuresViolation(lines 1461 1463) no Hoare annotation was computed. [2018-01-20 23:59:48,883 INFO L401 ceAbstractionStarter]: For program point L1462''(line 1462) no Hoare annotation was computed. [2018-01-20 23:59:48,883 INFO L401 ceAbstractionStarter]: For program point L1462'(line 1462) no Hoare annotation was computed. [2018-01-20 23:59:48,883 INFO L401 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1461 1463) no Hoare annotation was computed. [2018-01-20 23:59:48,883 INFO L401 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1461 1463) no Hoare annotation was computed. [2018-01-20 23:59:48,883 INFO L401 ceAbstractionStarter]: For program point L1462(line 1462) no Hoare annotation was computed. [2018-01-20 23:59:48,883 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1466 1472) no Hoare annotation was computed. [2018-01-20 23:59:48,883 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1466 1472) no Hoare annotation was computed. [2018-01-20 23:59:48,883 INFO L401 ceAbstractionStarter]: For program point L1467'(line 1467) no Hoare annotation was computed. [2018-01-20 23:59:48,883 INFO L404 ceAbstractionStarter]: At program point L1470(line 1470) the Hoare annotation is: true [2018-01-20 23:59:48,884 INFO L401 ceAbstractionStarter]: For program point L1469'(lines 1469 1471) no Hoare annotation was computed. [2018-01-20 23:59:48,884 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1466 1472) the Hoare annotation is: true [2018-01-20 23:59:48,884 INFO L401 ceAbstractionStarter]: For program point L1469(lines 1469 1471) no Hoare annotation was computed. [2018-01-20 23:59:48,884 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1466 1472) no Hoare annotation was computed. [2018-01-20 23:59:48,884 INFO L404 ceAbstractionStarter]: At program point L1467(line 1467) the Hoare annotation is: true [2018-01-20 23:59:48,884 INFO L401 ceAbstractionStarter]: For program point L1468(line 1468) no Hoare annotation was computed. [2018-01-20 23:59:48,884 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-20 23:59:48,885 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-20 23:59:48,885 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-20 23:59:48,885 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-20 23:59:48,885 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-20 23:59:48,885 INFO L404 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: true [2018-01-20 23:59:48,885 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-20 23:59:48,886 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-20 23:59:48,886 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-20 23:59:48,886 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-20 23:59:48,886 INFO L404 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: true [2018-01-20 23:59:48,886 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-20 23:59:48,886 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0EnsuresViolation(lines 1442 1459) no Hoare annotation was computed. [2018-01-20 23:59:48,886 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-20 23:59:48,887 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-20 23:59:48,887 INFO L404 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: true [2018-01-20 23:59:48,887 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-20 23:59:48,887 INFO L404 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: true [2018-01-20 23:59:48,887 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-20 23:59:48,887 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-20 23:59:48,887 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-20 23:59:48,891 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:48,892 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:48,892 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:48,892 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:48,892 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:48,892 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:48,892 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:48,892 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-20 23:59:48,893 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 23:59:48,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-20 23:59:48,895 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:48,895 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:48,895 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:59:48,896 INFO L82 PathProgramCache]: Analyzing trace with hash 670629914, now seen corresponding path program 1 times [2018-01-20 23:59:48,896 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:48,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:48,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:48,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:48,897 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:48,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:48,942 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:48,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:59:48,942 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:48,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:59:48,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:59:48,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:48,943 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-20 23:59:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:49,028 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-20 23:59:49,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:59:49,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-20 23:59:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:49,030 INFO L225 Difference]: With dead ends: 66 [2018-01-20 23:59:49,031 INFO L226 Difference]: Without dead ends: 16 [2018-01-20 23:59:49,031 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-20 23:59:49,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-01-20 23:59:49,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-01-20 23:59:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-01-20 23:59:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-01-20 23:59:49,042 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 13 [2018-01-20 23:59:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:49,043 INFO L432 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-01-20 23:59:49,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:59:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-01-20 23:59:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 23:59:49,044 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:49,044 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:49,044 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-20 23:59:49,044 INFO L82 PathProgramCache]: Analyzing trace with hash 230160188, now seen corresponding path program 1 times [2018-01-20 23:59:49,044 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:49,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:49,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,046 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:49,111 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:59:49,120 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:49,122 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:49,134 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:49,134 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:49,135 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:49,135 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:49,135 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:49,135 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:49,135 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:49,135 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:59:49,135 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 23:59:49,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:59:49,138 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:49,138 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:59:49,138 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:59:49,138 INFO L82 PathProgramCache]: Analyzing trace with hash 101483, now seen corresponding path program 1 times [2018-01-20 23:59:49,139 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:49,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,141 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:49,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,141 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:49,150 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:59:49,150 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:49,153 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:49,153 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:49,153 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:49,153 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:49,153 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:49,153 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:49,153 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:49,153 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:59:49,154 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 23:59:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 23:59:49,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:49,157 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:49,157 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:59:49,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1487692289, now seen corresponding path program 1 times [2018-01-20 23:59:49,158 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:49,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:49,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,160 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:59:49,197 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:59:49,200 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:49,201 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:49,201 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:49,202 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:49,202 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:49,202 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:59:49,205 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:49,206 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:49,206 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:49,206 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:49,206 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:49,206 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:49,206 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:49,206 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:59:49,206 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 23:59:49,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 23:59:49,208 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:49,208 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:49,209 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:59:49,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2146797079, now seen corresponding path program 1 times [2018-01-20 23:59:49,209 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:49,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:49,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,210 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:49,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:49,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:49,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:59:49,254 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:49,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:59:49,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:59:49,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:49,255 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-20 23:59:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:49,310 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-20 23:59:49,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:59:49,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-20 23:59:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:49,311 INFO L225 Difference]: With dead ends: 66 [2018-01-20 23:59:49,311 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:49,312 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-20 23:59:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:49,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:49,312 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-20 23:59:49,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:49,312 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:49,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:59:49,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:49,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:49,314 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:49,314 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:49,314 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:49,314 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:49,314 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:49,314 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:49,314 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:49,314 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_6Err0EnsuresViolation======== [2018-01-20 23:59:49,314 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 23:59:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 23:59:49,316 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:49,316 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:49,316 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_6Err0EnsuresViolation]=== [2018-01-20 23:59:49,316 INFO L82 PathProgramCache]: Analyzing trace with hash 563976181, now seen corresponding path program 1 times [2018-01-20 23:59:49,316 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:49,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:49,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,318 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:49,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:49,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:49,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 23:59:49,388 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:49,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 23:59:49,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 23:59:49,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-20 23:59:49,389 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-20 23:59:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:49,424 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-01-20 23:59:49,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 23:59:49,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-20 23:59:49,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:49,425 INFO L225 Difference]: With dead ends: 91 [2018-01-20 23:59:49,425 INFO L226 Difference]: Without dead ends: 45 [2018-01-20 23:59:49,426 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-20 23:59:49,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-20 23:59:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-20 23:59:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-20 23:59:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-01-20 23:59:49,432 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 26 [2018-01-20 23:59:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:49,432 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-01-20 23:59:49,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 23:59:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-01-20 23:59:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 23:59:49,433 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:49,433 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-20 23:59:49,434 INFO L371 AbstractCegarLoop]: === Iteration 2 === [disconnect_6Err0EnsuresViolation]=== [2018-01-20 23:59:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash -493276934, now seen corresponding path program 1 times [2018-01-20 23:59:49,434 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:49,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,435 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:49,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,435 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:49,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:49,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:49,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:59:49,508 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:49,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:59:49,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:59:49,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:49,509 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 5 states. [2018-01-20 23:59:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:49,535 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-20 23:59:49,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:59:49,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-20 23:59:49,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:49,537 INFO L225 Difference]: With dead ends: 76 [2018-01-20 23:59:49,537 INFO L226 Difference]: Without dead ends: 45 [2018-01-20 23:59:49,539 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-20 23:59:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-20 23:59:49,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-20 23:59:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-20 23:59:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-01-20 23:59:49,545 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 34 [2018-01-20 23:59:49,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:49,545 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-01-20 23:59:49,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:59:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-01-20 23:59:49,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-20 23:59:49,547 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:49,547 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-20 23:59:49,547 INFO L371 AbstractCegarLoop]: === Iteration 3 === [disconnect_6Err0EnsuresViolation]=== [2018-01-20 23:59:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2073205992, now seen corresponding path program 1 times [2018-01-20 23:59:49,548 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:49,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,549 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:49,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,550 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:49,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:49,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:49,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:59:49,594 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:49,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:59:49,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:59:49,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:59:49,595 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 4 states. [2018-01-20 23:59:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:49,620 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-01-20 23:59:49,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:59:49,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-20 23:59:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:49,621 INFO L225 Difference]: With dead ends: 45 [2018-01-20 23:59:49,621 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:49,622 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-20 23:59:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:49,622 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-01-20 23:59:49,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:49,623 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:49,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:59:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:49,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:49,625 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:49,625 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:49,625 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:49,626 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:49,626 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:49,626 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:49,626 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:49,626 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-20 23:59:49,626 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 23:59:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 23:59:49,628 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:49,628 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:49,629 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-20 23:59:49,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2062568257, now seen corresponding path program 1 times [2018-01-20 23:59:49,629 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:49,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,630 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:49,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,630 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:49,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:49,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:49,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:59:49,718 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:49,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:59:49,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:59:49,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:59:49,719 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 4 states. [2018-01-20 23:59:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:49,850 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-20 23:59:49,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:59:49,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-20 23:59:49,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:49,850 INFO L225 Difference]: With dead ends: 66 [2018-01-20 23:59:49,851 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:49,851 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-20 23:59:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:49,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-20 23:59:49,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:49,852 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:49,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:59:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:49,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:49,855 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:49,855 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:49,855 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:49,855 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:49,855 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:49,855 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:49,855 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:49,856 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == g6Err0EnsuresViolation======== [2018-01-20 23:59:49,856 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 23:59:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 23:59:49,863 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:49,863 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:49,863 INFO L371 AbstractCegarLoop]: === Iteration 1 === [g6Err0EnsuresViolation]=== [2018-01-20 23:59:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash -527098219, now seen corresponding path program 1 times [2018-01-20 23:59:49,864 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:49,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:49,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,866 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:49,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:49,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:49,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:59:49,924 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:49,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:59:49,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:59:49,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:49,924 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-01-20 23:59:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:49,957 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-01-20 23:59:49,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:59:49,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-20 23:59:49,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:49,959 INFO L225 Difference]: With dead ends: 110 [2018-01-20 23:59:49,959 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:49,960 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-20 23:59:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:49,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:49,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-20 23:59:49,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:49,961 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:49,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:59:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:49,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:49,963 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:59:49,963 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:59:49,963 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:59:49,963 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:59:49,964 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:59:49,964 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:59:49,964 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:59:49,964 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe1_6Err0EnsuresViolation======== [2018-01-20 23:59:49,964 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:59:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-20 23:59:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-20 23:59:49,966 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:49,966 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:49,966 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe1_6Err0EnsuresViolation]=== [2018-01-20 23:59:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2063614678, now seen corresponding path program 1 times [2018-01-20 23:59:49,966 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:49,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,968 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:49,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:49,968 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:49,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:50,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:50,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:59:50,009 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:50,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:59:50,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:59:50,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:59:50,010 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-20 23:59:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:50,062 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-01-20 23:59:50,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:59:50,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-20 23:59:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:50,063 INFO L225 Difference]: With dead ends: 66 [2018-01-20 23:59:50,063 INFO L226 Difference]: Without dead ends: 35 [2018-01-20 23:59:50,064 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-20 23:59:50,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-20 23:59:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-01-20 23:59:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-20 23:59:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-20 23:59:50,067 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 17 [2018-01-20 23:59:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:50,068 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-20 23:59:50,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:59:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-20 23:59:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 23:59:50,068 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:50,069 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:50,069 INFO L371 AbstractCegarLoop]: === Iteration 2 === [probe1_6Err0EnsuresViolation]=== [2018-01-20 23:59:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash -527172987, now seen corresponding path program 1 times [2018-01-20 23:59:50,069 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:50,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:50,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:50,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:50,070 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:50,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:50,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:50,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:59:50,150 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:50,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:59:50,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:59:50,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:59:50,151 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 5 states. [2018-01-20 23:59:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:50,163 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-20 23:59:50,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:59:50,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-20 23:59:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:50,165 INFO L225 Difference]: With dead ends: 54 [2018-01-20 23:59:50,165 INFO L226 Difference]: Without dead ends: 34 [2018-01-20 23:59:50,165 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-20 23:59:50,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-20 23:59:50,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-20 23:59:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-20 23:59:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-01-20 23:59:50,170 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 25 [2018-01-20 23:59:50,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:50,170 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-01-20 23:59:50,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:59:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-01-20 23:59:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 23:59:50,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:59:50,171 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:59:50,172 INFO L371 AbstractCegarLoop]: === Iteration 3 === [probe1_6Err0EnsuresViolation]=== [2018-01-20 23:59:50,172 INFO L82 PathProgramCache]: Analyzing trace with hash 838815399, now seen corresponding path program 1 times [2018-01-20 23:59:50,172 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:59:50,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:50,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:59:50,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:59:50,173 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:59:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:59:50,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:59:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:59:50,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:59:50,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:59:50,206 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:59:50,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:59:50,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:59:50,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:59:50,207 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 4 states. [2018-01-20 23:59:50,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:59:50,237 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-01-20 23:59:50,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:59:50,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-20 23:59:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:59:50,237 INFO L225 Difference]: With dead ends: 34 [2018-01-20 23:59:50,237 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:59:50,238 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-20 23:59:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:59:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:59:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:59:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:59:50,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-20 23:59:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:59:50,238 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:59:50,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:59:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:59:50,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:59:50,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:59:50 BoogieIcfgContainer [2018-01-20 23:59:50,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:59:50,242 INFO L168 Benchmark]: Toolchain (without parser) took 2557.05 ms. Allocated memory was 305.7 MB in the beginning and 478.7 MB in the end (delta: 173.0 MB). Free memory was 263.0 MB in the beginning and 401.0 MB in the end (delta: -138.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:59:50,243 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:59:50,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.08 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 250.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:59:50,243 INFO L168 Benchmark]: Boogie Preprocessor took 38.58 ms. Allocated memory is still 305.7 MB. Free memory was 250.0 MB in the beginning and 247.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-20 23:59:50,243 INFO L168 Benchmark]: RCFGBuilder took 276.90 ms. Allocated memory is still 305.7 MB. Free memory was 247.9 MB in the beginning and 229.2 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. [2018-01-20 23:59:50,244 INFO L168 Benchmark]: TraceAbstraction took 2004.77 ms. Allocated memory was 305.7 MB in the beginning and 478.7 MB in the end (delta: 173.0 MB). Free memory was 229.2 MB in the beginning and 401.0 MB in the end (delta: -171.8 MB). Peak memory consumption was 1.2 MB. Max. memory is 5.3 GB. [2018-01-20 23:59:50,246 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.20 ms. Allocated memory is still 305.7 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.08 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 250.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.58 ms. Allocated memory is still 305.7 MB. Free memory was 250.0 MB in the beginning and 247.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 276.90 ms. Allocated memory is still 305.7 MB. Free memory was 247.9 MB in the beginning and 229.2 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2004.77 ms. Allocated memory was 305.7 MB in the beginning and 478.7 MB in the end (delta: 173.0 MB). Free memory was 229.2 MB in the beginning and 401.0 MB in the end (delta: -171.8 MB). Peak memory consumption was 1.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - 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.6s 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.0s 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.2s 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-59-50-256.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-59-50-256.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-59-50-256.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-59-50-256.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-59-50-256.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-20_23-59-50-256.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-20_23-59-50-256.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-20_23-59-50-256.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-20_23-59-50-256.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-20_23-59-50-256.csv Received shutdown request...