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/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:37:56,387 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:37:56,390 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:37:56,405 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:37:56,405 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:37:56,406 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:37:56,407 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:37:56,413 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:37:56,415 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:37:56,415 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:37:56,416 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:37:56,416 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:37:56,417 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:37:56,418 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:37:56,419 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:37:56,421 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:37:56,424 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:37:56,426 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:37:56,427 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:37:56,428 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:37:56,431 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:37:56,431 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:37:56,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:37:56,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:37:56,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:37:56,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:37:56,435 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:37:56,436 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:37:56,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:37:56,436 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:37:56,437 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:37:56,437 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:37:56,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:37:56,449 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:37:56,450 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:37:56,450 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:37:56,450 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:37:56,450 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:37:56,450 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:37:56,451 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:37:56,451 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:37:56,452 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:37:56,452 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:37:56,452 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:37:56,452 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:37:56,452 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:37:56,453 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:37:56,453 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:37:56,453 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:37:56,453 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:37:56,453 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:37:56,454 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:37:56,454 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:37:56,454 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:37:56,454 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:37:56,454 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:37:56,455 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:37:56,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:37:56,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:37:56,455 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:37:56,455 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:37:56,455 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:37:56,456 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:37:56,456 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:37:56,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:37:56,456 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:37:56,456 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:37:56,457 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:37:56,457 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:37:56,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:37:56,537 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:37:56,542 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:37:56,546 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:37:56,547 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:37:56,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test3_true-valid-memsafety_true-termination.i [2018-01-25 03:37:56,885 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:37:56,891 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:37:56,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:37:56,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:37:56,898 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:37:56,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:37:56" (1/1) ... [2018-01-25 03:37:56,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a221e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:37:56, skipping insertion in model container [2018-01-25 03:37:56,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:37:56" (1/1) ... [2018-01-25 03:37:56,917 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:37:56,995 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:37:57,126 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:37:57,144 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:37:57,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:37:57 WrapperNode [2018-01-25 03:37:57,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:37:57,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:37:57,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:37:57,154 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:37:57,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:37:57" (1/1) ... [2018-01-25 03:37:57,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:37:57" (1/1) ... [2018-01-25 03:37:57,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:37:57" (1/1) ... [2018-01-25 03:37:57,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:37:57" (1/1) ... [2018-01-25 03:37:57,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:37:57" (1/1) ... [2018-01-25 03:37:57,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:37:57" (1/1) ... [2018-01-25 03:37:57,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:37:57" (1/1) ... [2018-01-25 03:37:57,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:37:57,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:37:57,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:37:57,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:37:57,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:37:57" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:37:57,261 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:37:57,261 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:37:57,261 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 03:37:57,261 INFO L136 BoogieDeclarations]: Found implementation of procedure h_safe [2018-01-25 03:37:57,262 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 03:37:57,262 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:37:57,262 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:37:57,262 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:37:57,262 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:37:57,262 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:37:57,263 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:37:57,263 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:37:57,263 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 03:37:57,263 INFO L128 BoogieDeclarations]: Found specification of procedure h_safe [2018-01-25 03:37:57,263 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 03:37:57,263 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:37:57,263 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:37:57,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:37:57,436 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:37:57,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:37:57 BoogieIcfgContainer [2018-01-25 03:37:57,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:37:57,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:37:57,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:37:57,441 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:37:57,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:37:56" (1/3) ... [2018-01-25 03:37:57,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbf3887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:37:57, skipping insertion in model container [2018-01-25 03:37:57,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:37:57" (2/3) ... [2018-01-25 03:37:57,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbf3887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:37:57, skipping insertion in model container [2018-01-25 03:37:57,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:37:57" (3/3) ... [2018-01-25 03:37:57,445 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test3_true-valid-memsafety_true-termination.i [2018-01-25 03:37:57,453 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:37:57,460 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-25 03:37:57,502 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:37:57,502 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:37:57,503 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:37:57,503 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:37:57,503 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:37:57,503 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:37:57,503 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:37:57,503 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:37:57,504 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:37:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-01-25 03:37:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 03:37:57,533 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:37:57,534 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:37:57,535 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:37:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash -36513995, now seen corresponding path program 1 times [2018-01-25 03:37:57,543 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:37:57,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:57,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:37:57,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:57,595 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:37:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:37:57,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:37:57,833 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-25 03:37:57,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:37:57,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:37:57,836 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:37:57,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:37:57,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:37:57,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:37:57,860 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 7 states. [2018-01-25 03:37:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:37:58,090 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-01-25 03:37:58,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:37:58,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-25 03:37:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:37:58,103 INFO L225 Difference]: With dead ends: 39 [2018-01-25 03:37:58,104 INFO L226 Difference]: Without dead ends: 35 [2018-01-25 03:37:58,107 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:37:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-25 03:37:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-01-25 03:37:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 03:37:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-01-25 03:37:58,144 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 18 [2018-01-25 03:37:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:37:58,145 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-01-25 03:37:58,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:37:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-01-25 03:37:58,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 03:37:58,145 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:37:58,146 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:37:58,146 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:37:58,146 INFO L82 PathProgramCache]: Analyzing trace with hash -36513994, now seen corresponding path program 1 times [2018-01-25 03:37:58,146 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:37:58,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:58,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:37:58,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:58,149 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:37:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:37:58,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:37:58,279 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-25 03:37:58,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:37:58,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:37:58,280 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:37:58,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:37:58,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:37:58,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:37:58,282 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 7 states. [2018-01-25 03:37:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:37:58,422 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-25 03:37:58,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:37:58,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-25 03:37:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:37:58,425 INFO L225 Difference]: With dead ends: 37 [2018-01-25 03:37:58,425 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 03:37:58,426 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:37:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 03:37:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-01-25 03:37:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 03:37:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-25 03:37:58,438 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-01-25 03:37:58,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:37:58,439 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-25 03:37:58,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:37:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-25 03:37:58,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:37:58,440 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:37:58,440 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:37:58,440 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:37:58,441 INFO L82 PathProgramCache]: Analyzing trace with hash 133826739, now seen corresponding path program 1 times [2018-01-25 03:37:58,441 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:37:58,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:58,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:37:58,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:58,443 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:37:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:37:58,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:37:58,546 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-25 03:37:58,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:37:58,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:37:58,546 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:37:58,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:37:58,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:37:58,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:37:58,548 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-01-25 03:37:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:37:58,603 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-01-25 03:37:58,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:37:58,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 03:37:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:37:58,605 INFO L225 Difference]: With dead ends: 34 [2018-01-25 03:37:58,605 INFO L226 Difference]: Without dead ends: 33 [2018-01-25 03:37:58,606 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:37:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-25 03:37:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-25 03:37:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-25 03:37:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-01-25 03:37:58,612 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2018-01-25 03:37:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:37:58,613 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-01-25 03:37:58,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:37:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-01-25 03:37:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:37:58,614 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:37:58,614 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:37:58,614 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:37:58,615 INFO L82 PathProgramCache]: Analyzing trace with hash 133826740, now seen corresponding path program 1 times [2018-01-25 03:37:58,615 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:37:58,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:58,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:37:58,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:58,617 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:37:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:37:58,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:37:58,716 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-25 03:37:58,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:37:58,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:37:58,716 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:37:58,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:37:58,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:37:58,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:37:58,718 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 8 states. [2018-01-25 03:37:58,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:37:58,830 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-01-25 03:37:58,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:37:58,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 03:37:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:37:58,831 INFO L225 Difference]: With dead ends: 35 [2018-01-25 03:37:58,832 INFO L226 Difference]: Without dead ends: 34 [2018-01-25 03:37:58,832 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:37:58,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-25 03:37:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2018-01-25 03:37:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-25 03:37:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-01-25 03:37:58,837 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-01-25 03:37:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:37:58,838 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-01-25 03:37:58,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:37:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-01-25 03:37:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:37:58,839 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:37:58,839 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:37:58,839 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:37:58,839 INFO L82 PathProgramCache]: Analyzing trace with hash -730055936, now seen corresponding path program 1 times [2018-01-25 03:37:58,840 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:37:58,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:58,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:37:58,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:58,841 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:37:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:37:58,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:37:58,891 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-25 03:37:58,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:37:58,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:37:58,891 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:37:58,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:37:58,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:37:58,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:37:58,893 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2018-01-25 03:37:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:37:58,916 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-01-25 03:37:58,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:37:58,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-25 03:37:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:37:58,918 INFO L225 Difference]: With dead ends: 36 [2018-01-25 03:37:58,918 INFO L226 Difference]: Without dead ends: 32 [2018-01-25 03:37:58,918 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-25 03:37:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-25 03:37:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-01-25 03:37:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-25 03:37:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-01-25 03:37:58,924 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 20 [2018-01-25 03:37:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:37:58,924 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-01-25 03:37:58,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:37:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-01-25 03:37:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 03:37:58,925 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:37:58,925 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] [2018-01-25 03:37:58,926 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:37:58,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1161698987, now seen corresponding path program 1 times [2018-01-25 03:37:58,926 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:37:58,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:58,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:37:58,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:58,928 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:37:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:37:58,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:37:59,204 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-25 03:37:59,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:37:59,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:37:59,205 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:37:59,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:37:59,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:37:59,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:37:59,207 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 7 states. [2018-01-25 03:37:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:37:59,274 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-01-25 03:37:59,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:37:59,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-25 03:37:59,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:37:59,276 INFO L225 Difference]: With dead ends: 38 [2018-01-25 03:37:59,276 INFO L226 Difference]: Without dead ends: 26 [2018-01-25 03:37:59,276 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:37:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-25 03:37:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-01-25 03:37:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-25 03:37:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-01-25 03:37:59,281 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-01-25 03:37:59,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:37:59,282 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-01-25 03:37:59,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:37:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-01-25 03:37:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:37:59,283 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:37:59,283 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] [2018-01-25 03:37:59,283 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:37:59,284 INFO L82 PathProgramCache]: Analyzing trace with hash -241367810, now seen corresponding path program 1 times [2018-01-25 03:37:59,284 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:37:59,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:59,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:37:59,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:59,286 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:37:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:37:59,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:37:59,378 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-25 03:37:59,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:37:59,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:37:59,378 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:37:59,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:37:59,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:37:59,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:37:59,380 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 8 states. [2018-01-25 03:37:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:37:59,439 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2018-01-25 03:37:59,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:37:59,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-25 03:37:59,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:37:59,442 INFO L225 Difference]: With dead ends: 28 [2018-01-25 03:37:59,442 INFO L226 Difference]: Without dead ends: 24 [2018-01-25 03:37:59,442 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:37:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-25 03:37:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-25 03:37:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-25 03:37:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2018-01-25 03:37:59,453 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 22 [2018-01-25 03:37:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:37:59,453 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2018-01-25 03:37:59,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:37:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2018-01-25 03:37:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:37:59,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:37:59,455 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-25 03:37:59,455 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-25 03:37:59,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1102731031, now seen corresponding path program 1 times [2018-01-25 03:37:59,455 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:37:59,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:59,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:37:59,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:37:59,457 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:37:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:37:59,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:37:59,675 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-25 03:37:59,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:37:59,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:37:59,676 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:37:59,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:37:59,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:37:59,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:37:59,677 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 9 states. [2018-01-25 03:37:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:37:59,811 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2018-01-25 03:37:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:37:59,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-25 03:37:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:37:59,812 INFO L225 Difference]: With dead ends: 24 [2018-01-25 03:37:59,812 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 03:37:59,813 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:37:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 03:37:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 03:37:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 03:37:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 03:37:59,814 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-25 03:37:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:37:59,814 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 03:37:59,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:37:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 03:37:59,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 03:37:59,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 03:37:59,889 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:37:59,889 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-25 03:37:59,889 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-25 03:37:59,889 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 03:37:59,889 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 03:37:59,889 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-25 03:37:59,890 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1444) no Hoare annotation was computed. [2018-01-25 03:37:59,890 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1444) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:37:59,890 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1444) no Hoare annotation was computed. [2018-01-25 03:37:59,890 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1444) the Hoare annotation is: true [2018-01-25 03:37:59,890 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1444) no Hoare annotation was computed. [2018-01-25 03:37:59,890 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1444) the Hoare annotation is: true [2018-01-25 03:37:59,890 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1444) no Hoare annotation was computed. [2018-01-25 03:37:59,890 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1442 1444) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:37:59,890 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1442 1444) no Hoare annotation was computed. [2018-01-25 03:37:59,890 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1442 1444) no Hoare annotation was computed. [2018-01-25 03:37:59,890 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1442 1444) no Hoare annotation was computed. [2018-01-25 03:37:59,891 INFO L397 ceAbstractionStarter]: At program point h_safeENTRY(lines 1433 1435) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:37:59,891 INFO L401 ceAbstractionStarter]: For program point L1434(line 1434) no Hoare annotation was computed. [2018-01-25 03:37:59,891 INFO L401 ceAbstractionStarter]: For program point h_safeFINAL(lines 1433 1435) no Hoare annotation was computed. [2018-01-25 03:37:59,891 INFO L401 ceAbstractionStarter]: For program point h_safeEXIT(lines 1433 1435) no Hoare annotation was computed. [2018-01-25 03:37:59,891 INFO L401 ceAbstractionStarter]: For program point L1438(line 1438) no Hoare annotation was computed. [2018-01-25 03:37:59,891 INFO L401 ceAbstractionStarter]: For program point L1439(line 1439) no Hoare annotation was computed. [2018-01-25 03:37:59,891 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1437 1440) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:37:59,891 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-25 03:37:59,891 INFO L401 ceAbstractionStarter]: For program point entry_pointErr1RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-25 03:37:59,891 INFO L401 ceAbstractionStarter]: For program point L1439'(line 1439) no Hoare annotation was computed. [2018-01-25 03:37:59,891 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1437 1440) no Hoare annotation was computed. [2018-01-25 03:37:59,891 INFO L401 ceAbstractionStarter]: For program point L1439'''(line 1439) no Hoare annotation was computed. [2018-01-25 03:37:59,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:37:59 BoogieIcfgContainer [2018-01-25 03:37:59,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:37:59,895 INFO L168 Benchmark]: Toolchain (without parser) took 3009.70 ms. Allocated memory was 314.0 MB in the beginning and 462.4 MB in the end (delta: 148.4 MB). Free memory was 272.9 MB in the beginning and 385.0 MB in the end (delta: -112.1 MB). Peak memory consumption was 36.3 MB. Max. memory is 5.3 GB. [2018-01-25 03:37:59,896 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 314.0 MB. Free memory is still 278.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:37:59,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.70 ms. Allocated memory is still 314.0 MB. Free memory was 272.9 MB in the beginning and 258.9 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:37:59,897 INFO L168 Benchmark]: Boogie Preprocessor took 41.56 ms. Allocated memory is still 314.0 MB. Free memory is still 258.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:37:59,897 INFO L168 Benchmark]: RCFGBuilder took 242.08 ms. Allocated memory is still 314.0 MB. Free memory was 258.9 MB in the beginning and 243.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:37:59,897 INFO L168 Benchmark]: TraceAbstraction took 2456.01 ms. Allocated memory was 314.0 MB in the beginning and 462.4 MB in the end (delta: 148.4 MB). Free memory was 243.9 MB in the beginning and 385.0 MB in the end (delta: -141.1 MB). Peak memory consumption was 7.3 MB. Max. memory is 5.3 GB. [2018-01-25 03:37:59,899 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.56 ms. Allocated memory is still 314.0 MB. Free memory is still 278.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 260.70 ms. Allocated memory is still 314.0 MB. Free memory was 272.9 MB in the beginning and 258.9 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.56 ms. Allocated memory is still 314.0 MB. Free memory is still 258.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 242.08 ms. Allocated memory is still 314.0 MB. Free memory was 258.9 MB in the beginning and 243.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2456.01 ms. Allocated memory was 314.0 MB in the beginning and 462.4 MB in the end (delta: 148.4 MB). Free memory was 243.9 MB in the beginning and 385.0 MB in the end (delta: -141.1 MB). Peak memory consumption was 7.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1442]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 3 error locations. SAFE Result, 2.3s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 171 SDtfs, 28 SDslu, 739 SDs, 0 SdLazy, 334 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=1, 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, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 17 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 10584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-37-59-908.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-37-59-908.csv Received shutdown request...