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_test5_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:38:17,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:38:17,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:38:17,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:38:17,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:38:17,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:38:17,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:38:17,612 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:38:17,613 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:38:17,614 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:38:17,614 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:38:17,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:38:17,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:38:17,616 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:38:17,617 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:38:17,619 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:38:17,621 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:38:17,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:38:17,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:38:17,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:38:17,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:38:17,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:38:17,629 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:38:17,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:38:17,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:38:17,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:38:17,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:38:17,634 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:38:17,634 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:38:17,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:38:17,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:38:17,635 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:38:17,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:38:17,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:38:17,647 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:38:17,647 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:38:17,647 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:38:17,647 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:38:17,647 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:38:17,648 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:38:17,648 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:38:17,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:38:17,649 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:38:17,649 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:38:17,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:38:17,649 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:38:17,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:38:17,650 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:38:17,650 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:38:17,650 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:38:17,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:38:17,651 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:38:17,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:38:17,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:38:17,651 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:38:17,651 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:38:17,652 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:38:17,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:38:17,652 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:38:17,652 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:38:17,652 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:38:17,653 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:38:17,653 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:38:17,653 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:38:17,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:38:17,653 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:38:17,654 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:38:17,654 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:38:17,655 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:38:17,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:38:17,705 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:38:17,710 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:38:17,712 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:38:17,712 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:38:17,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test5_true-valid-memsafety_true-termination.i [2018-01-25 03:38:17,941 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:38:17,948 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:38:17,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:38:17,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:38:17,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:38:17,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:38:17" (1/1) ... [2018-01-25 03:38:17,962 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:38:17, skipping insertion in model container [2018-01-25 03:38:17,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:38:17" (1/1) ... [2018-01-25 03:38:17,982 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:38:18,031 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:38:18,148 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:38:18,164 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:38:18,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:18 WrapperNode [2018-01-25 03:38:18,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:38:18,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:38:18,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:38:18,173 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:38:18,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:18" (1/1) ... [2018-01-25 03:38:18,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:18" (1/1) ... [2018-01-25 03:38:18,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:18" (1/1) ... [2018-01-25 03:38:18,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:18" (1/1) ... [2018-01-25 03:38:18,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:18" (1/1) ... [2018-01-25 03:38:18,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:18" (1/1) ... [2018-01-25 03:38:18,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:18" (1/1) ... [2018-01-25 03:38:18,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:38:18,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:38:18,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:38:18,209 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:38:18,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:18" (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:38:18,267 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:38:18,268 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:38:18,268 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 03:38:18,268 INFO L136 BoogieDeclarations]: Found implementation of procedure h5 [2018-01-25 03:38:18,268 INFO L136 BoogieDeclarations]: Found implementation of procedure g5 [2018-01-25 03:38:18,268 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 03:38:18,268 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:38:18,268 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:38:18,268 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:38:18,269 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:38:18,269 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:38:18,269 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:38:18,269 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:38:18,269 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 03:38:18,269 INFO L128 BoogieDeclarations]: Found specification of procedure h5 [2018-01-25 03:38:18,270 INFO L128 BoogieDeclarations]: Found specification of procedure g5 [2018-01-25 03:38:18,270 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 03:38:18,270 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:38:18,270 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:38:18,270 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:38:18,478 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:38:18,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:38:18 BoogieIcfgContainer [2018-01-25 03:38:18,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:38:18,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:38:18,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:38:18,482 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:38:18,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:38:17" (1/3) ... [2018-01-25 03:38:18,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb6d0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:38:18, skipping insertion in model container [2018-01-25 03:38:18,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:18" (2/3) ... [2018-01-25 03:38:18,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb6d0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:38:18, skipping insertion in model container [2018-01-25 03:38:18,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:38:18" (3/3) ... [2018-01-25 03:38:18,487 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test5_true-valid-memsafety_true-termination.i [2018-01-25 03:38:18,497 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:38:18,505 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-25 03:38:18,561 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:38:18,562 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:38:18,562 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:38:18,562 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:38:18,562 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:38:18,562 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:38:18,563 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:38:18,563 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:38:18,564 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:38:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-01-25 03:38:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:38:18,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:18,594 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:38:18,594 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-25 03:38:18,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1224818119, now seen corresponding path program 1 times [2018-01-25 03:38:18,603 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:18,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:18,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:18,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:18,676 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:18,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:19,010 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:38:19,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:19,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:38:19,013 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:19,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:38:19,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:38:19,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:38:19,036 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 9 states. [2018-01-25 03:38:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:19,252 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-01-25 03:38:19,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:38:19,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-25 03:38:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:19,266 INFO L225 Difference]: With dead ends: 49 [2018-01-25 03:38:19,266 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 03:38:19,269 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:38:19,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 03:38:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-01-25 03:38:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 03:38:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-25 03:38:19,304 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 20 [2018-01-25 03:38:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:19,305 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-25 03:38:19,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:38:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-25 03:38:19,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:38:19,306 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:19,306 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:38:19,306 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-25 03:38:19,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1224818118, now seen corresponding path program 1 times [2018-01-25 03:38:19,307 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:19,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:19,309 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:19,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:19,310 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:19,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:19,424 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:38:19,424 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:19,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:38:19,425 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:19,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:38:19,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:38:19,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:38:19,428 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 9 states. [2018-01-25 03:38:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:19,498 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-01-25 03:38:19,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:38:19,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-25 03:38:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:19,500 INFO L225 Difference]: With dead ends: 47 [2018-01-25 03:38:19,500 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 03:38:19,502 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:38:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 03:38:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-01-25 03:38:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 03:38:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-01-25 03:38:19,509 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 20 [2018-01-25 03:38:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:19,510 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-01-25 03:38:19,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:38:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-01-25 03:38:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:38:19,511 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:19,511 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:38:19,511 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-25 03:38:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1045905065, now seen corresponding path program 1 times [2018-01-25 03:38:19,512 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:19,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:19,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:19,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:19,514 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:19,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:19,623 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:38:19,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:19,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:38:19,624 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:19,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:38:19,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:38:19,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:38:19,625 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 10 states. [2018-01-25 03:38:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:19,712 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-01-25 03:38:19,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 03:38:19,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-25 03:38:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:19,714 INFO L225 Difference]: With dead ends: 42 [2018-01-25 03:38:19,715 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 03:38:19,715 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:38:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 03:38:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-25 03:38:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 03:38:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-01-25 03:38:19,720 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 22 [2018-01-25 03:38:19,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:19,721 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-01-25 03:38:19,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:38:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-01-25 03:38:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:38:19,722 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:19,722 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:38:19,722 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-25 03:38:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1045905064, now seen corresponding path program 1 times [2018-01-25 03:38:19,722 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:19,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:19,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:19,724 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:19,724 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:19,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:19,862 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:38:19,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:19,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:38:19,863 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:19,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:38:19,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:38:19,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:38:19,864 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2018-01-25 03:38:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:20,047 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-01-25 03:38:20,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:38:20,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-25 03:38:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:20,049 INFO L225 Difference]: With dead ends: 45 [2018-01-25 03:38:20,049 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 03:38:20,049 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:38:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 03:38:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2018-01-25 03:38:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-25 03:38:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-01-25 03:38:20,056 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2018-01-25 03:38:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:20,057 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-01-25 03:38:20,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:38:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-01-25 03:38:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:38:20,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:20,058 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:38:20,058 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-25 03:38:20,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1043029204, now seen corresponding path program 1 times [2018-01-25 03:38:20,059 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:20,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:20,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:20,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:20,061 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:20,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:20,145 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:38:20,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:20,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:38:20,146 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:20,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:38:20,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:38:20,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:38:20,147 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 3 states. [2018-01-25 03:38:20,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:20,191 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-25 03:38:20,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:38:20,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-25 03:38:20,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:20,192 INFO L225 Difference]: With dead ends: 41 [2018-01-25 03:38:20,193 INFO L226 Difference]: Without dead ends: 37 [2018-01-25 03:38:20,193 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:38:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-25 03:38:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-25 03:38:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 03:38:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-25 03:38:20,205 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2018-01-25 03:38:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:20,206 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-25 03:38:20,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:38:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-25 03:38:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 03:38:20,208 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:20,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-25 03:38:20,208 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-25 03:38:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1685081515, now seen corresponding path program 1 times [2018-01-25 03:38:20,208 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:20,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:20,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:20,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:20,210 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:20,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:20,329 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:38:20,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:20,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 03:38:20,330 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:20,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:38:20,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:38:20,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:38:20,331 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-01-25 03:38:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:20,474 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-25 03:38:20,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:38:20,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-01-25 03:38:20,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:20,475 INFO L225 Difference]: With dead ends: 41 [2018-01-25 03:38:20,475 INFO L226 Difference]: Without dead ends: 30 [2018-01-25 03:38:20,476 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:38:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-25 03:38:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-01-25 03:38:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-25 03:38:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-01-25 03:38:20,481 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-01-25 03:38:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:20,481 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-01-25 03:38:20,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:38:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-01-25 03:38:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:38:20,482 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:20,482 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-25 03:38:20,483 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-25 03:38:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1527636810, now seen corresponding path program 1 times [2018-01-25 03:38:20,483 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:20,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:20,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:20,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:20,485 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:20,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:20,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:38:20,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:20,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 03:38:20,676 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:20,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:38:20,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:38:20,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:38:20,677 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 10 states. [2018-01-25 03:38:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:20,869 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2018-01-25 03:38:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:38:20,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-25 03:38:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:20,871 INFO L225 Difference]: With dead ends: 34 [2018-01-25 03:38:20,871 INFO L226 Difference]: Without dead ends: 28 [2018-01-25 03:38:20,872 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:38:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-25 03:38:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-01-25 03:38:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-25 03:38:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2018-01-25 03:38:20,878 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 26 [2018-01-25 03:38:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:20,878 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2018-01-25 03:38:20,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:38:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2018-01-25 03:38:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:38:20,879 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:20,879 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-25 03:38:20,879 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-25 03:38:20,879 INFO L82 PathProgramCache]: Analyzing trace with hash -228650675, now seen corresponding path program 1 times [2018-01-25 03:38:20,880 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:20,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:20,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:20,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:20,881 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:20,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:21,171 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:38:21,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:21,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 03:38:21,172 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:21,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 03:38:21,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 03:38:21,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:38:21,173 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 11 states. [2018-01-25 03:38:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:21,305 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2018-01-25 03:38:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:38:21,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-01-25 03:38:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:21,305 INFO L225 Difference]: With dead ends: 28 [2018-01-25 03:38:21,305 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 03:38:21,306 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:38:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 03:38:21,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 03:38:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 03:38:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 03:38:21,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-25 03:38:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:21,307 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 03:38:21,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 03:38:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 03:38:21,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 03:38:21,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 03:38:21,379 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:38:21,380 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-25 03:38:21,380 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-25 03:38:21,380 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 03:38:21,380 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 03:38:21,380 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-25 03:38:21,380 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1451) no Hoare annotation was computed. [2018-01-25 03:38:21,380 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1451) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:38:21,380 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1451) no Hoare annotation was computed. [2018-01-25 03:38:21,380 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1451) the Hoare annotation is: true [2018-01-25 03:38:21,380 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1451) no Hoare annotation was computed. [2018-01-25 03:38:21,380 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1451) the Hoare annotation is: true [2018-01-25 03:38:21,381 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1451) no Hoare annotation was computed. [2018-01-25 03:38:21,381 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1449 1451) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:38:21,381 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1449 1451) no Hoare annotation was computed. [2018-01-25 03:38:21,381 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1449 1451) no Hoare annotation was computed. [2018-01-25 03:38:21,381 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1449 1451) no Hoare annotation was computed. [2018-01-25 03:38:21,381 INFO L401 ceAbstractionStarter]: For program point L1434(line 1434) no Hoare annotation was computed. [2018-01-25 03:38:21,381 INFO L401 ceAbstractionStarter]: For program point h5EXIT(lines 1433 1436) no Hoare annotation was computed. [2018-01-25 03:38:21,381 INFO L397 ceAbstractionStarter]: At program point h5ENTRY(lines 1433 1436) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:38:21,381 INFO L401 ceAbstractionStarter]: For program point h5FINAL(lines 1433 1436) no Hoare annotation was computed. [2018-01-25 03:38:21,381 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1444 1447) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:38:21,381 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1444 1447) no Hoare annotation was computed. [2018-01-25 03:38:21,381 INFO L401 ceAbstractionStarter]: For program point L1445(line 1445) no Hoare annotation was computed. [2018-01-25 03:38:21,382 INFO L397 ceAbstractionStarter]: At program point L1446(line 1446) the Hoare annotation is: (let ((.cse0 (= 0 entry_point_~p~10.base))) (let ((.cse1 (let ((.cse3 (= 0 entry_point_~p~10.offset))) (or (and (= 1 (select |#valid| entry_point_~p~10.base)) .cse3) (and .cse0 .cse3))))) (or (and .cse0 (= |#valid| |old(#valid)|) .cse1) (let ((.cse2 (select |old(#valid)| entry_point_~p~10.base))) (and (= (store |#valid| entry_point_~p~10.base .cse2) |old(#valid)|) (= 0 .cse2) (not .cse0) .cse1))))) [2018-01-25 03:38:21,382 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1444 1447) no Hoare annotation was computed. [2018-01-25 03:38:21,382 INFO L401 ceAbstractionStarter]: For program point g5Err1RequiresViolation(lines 1 1451) no Hoare annotation was computed. [2018-01-25 03:38:21,382 INFO L401 ceAbstractionStarter]: For program point g5EXIT(lines 1438 1442) no Hoare annotation was computed. [2018-01-25 03:38:21,382 INFO L401 ceAbstractionStarter]: For program point L1439(lines 1439 1441) no Hoare annotation was computed. [2018-01-25 03:38:21,382 INFO L401 ceAbstractionStarter]: For program point g5Err0RequiresViolation(lines 1 1451) no Hoare annotation was computed. [2018-01-25 03:38:21,382 INFO L397 ceAbstractionStarter]: At program point g5ENTRY(lines 1438 1442) the Hoare annotation is: (or (let ((.cse0 (not (= 0 |g5_#in~p.offset|)))) (and (or .cse0 (not (= (select |old(#valid)| |g5_#in~p.base|) 1))) (or .cse0 (not (= 0 |g5_#in~p.base|))))) (= |#valid| |old(#valid)|)) [2018-01-25 03:38:21,382 INFO L401 ceAbstractionStarter]: For program point L1439'(lines 1439 1441) no Hoare annotation was computed. [2018-01-25 03:38:21,383 INFO L401 ceAbstractionStarter]: For program point L1440(line 1440) no Hoare annotation was computed. [2018-01-25 03:38:21,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:38:21 BoogieIcfgContainer [2018-01-25 03:38:21,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:38:21,387 INFO L168 Benchmark]: Toolchain (without parser) took 3444.65 ms. Allocated memory was 302.0 MB in the beginning and 474.0 MB in the end (delta: 172.0 MB). Free memory was 260.9 MB in the beginning and 343.9 MB in the end (delta: -83.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:21,388 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:38:21,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.32 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 246.8 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:38:21,388 INFO L168 Benchmark]: Boogie Preprocessor took 35.50 ms. Allocated memory is still 302.0 MB. Free memory is still 246.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:38:21,388 INFO L168 Benchmark]: RCFGBuilder took 270.05 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 231.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:38:21,389 INFO L168 Benchmark]: TraceAbstraction took 2906.19 ms. Allocated memory was 302.0 MB in the beginning and 474.0 MB in the end (delta: 172.0 MB). Free memory was 231.9 MB in the beginning and 343.9 MB in the end (delta: -112.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:21,390 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.22 ms. Allocated memory is still 302.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.32 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 246.8 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.50 ms. Allocated memory is still 302.0 MB. Free memory is still 246.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 270.05 ms. Allocated memory is still 302.0 MB. Free memory was 246.8 MB in the beginning and 231.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2906.19 ms. Allocated memory was 302.0 MB in the beginning and 474.0 MB in the end (delta: 172.0 MB). Free memory was 231.9 MB in the beginning and 343.9 MB in the end (delta: -112.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1449]: 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 7 procedures, 33 locations, 3 error locations. SAFE Result, 2.8s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 196 SDtfs, 65 SDslu, 1163 SDs, 0 SdLazy, 571 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 10 PreInvPairs, 11 NumberOfFragments, 102 HoareAnnotationTreeSize, 10 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 15048 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_test5_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-38-21-400.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test5_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-38-21-400.csv Received shutdown request...