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_mostprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test5_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:48:38,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:48:38,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:48:38,431 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:48:38,431 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:48:38,432 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:48:38,433 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:48:38,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:48:38,437 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:48:38,438 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:48:38,438 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:48:38,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:48:38,439 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:48:38,441 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:48:38,441 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:48:38,444 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:48:38,446 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:48:38,448 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:48:38,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:48:38,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:48:38,453 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:48:38,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:48:38,454 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:48:38,455 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:48:38,455 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:48:38,457 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:48:38,457 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:48:38,458 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:48:38,458 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:48:38,458 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:48:38,459 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:48:38,459 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_mostprecise.epf [2018-01-24 20:48:38,468 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:48:38,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:48:38,469 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:48:38,470 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:48:38,470 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:48:38,470 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:48:38,470 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:48:38,471 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:48:38,471 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:48:38,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:48:38,472 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:48:38,472 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:48:38,472 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:48:38,472 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:48:38,473 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:48:38,473 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:48:38,473 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:48:38,473 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:48:38,473 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:48:38,473 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:48:38,474 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:48:38,474 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:48:38,474 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:48:38,474 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:48:38,475 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:48:38,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:48:38,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:48:38,475 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:48:38,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:48:38,476 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:48:38,476 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:48:38,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:48:38,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:48:38,476 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:48:38,477 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:48:38,478 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:48:38,478 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:48:38,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:48:38,526 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:48:38,530 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:48:38,532 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:48:38,532 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:48:38,533 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-24 20:48:38,731 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:48:38,736 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:48:38,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:48:38,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:48:38,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:48:38,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:48:38" (1/1) ... [2018-01-24 20:48:38,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c105265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:48:38, skipping insertion in model container [2018-01-24 20:48:38,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:48:38" (1/1) ... [2018-01-24 20:48:38,770 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:48:38,823 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:48:38,932 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:48:38,944 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:48:38,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:48:38 WrapperNode [2018-01-24 20:48:38,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:48:38,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:48:38,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:48:38,952 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:48:38,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:48:38" (1/1) ... [2018-01-24 20:48:38,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:48:38" (1/1) ... [2018-01-24 20:48:38,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:48:38" (1/1) ... [2018-01-24 20:48:38,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:48:38" (1/1) ... [2018-01-24 20:48:38,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:48:38" (1/1) ... [2018-01-24 20:48:38,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:48:38" (1/1) ... [2018-01-24 20:48:38,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:48:38" (1/1) ... [2018-01-24 20:48:38,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:48:38,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:48:38,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:48:38,983 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:48:38,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:48:38" (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-24 20:48:39,033 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:48:39,034 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:48:39,034 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 20:48:39,034 INFO L136 BoogieDeclarations]: Found implementation of procedure h5 [2018-01-24 20:48:39,034 INFO L136 BoogieDeclarations]: Found implementation of procedure g5 [2018-01-24 20:48:39,034 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 20:48:39,034 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:48:39,035 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:48:39,035 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:48:39,035 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:48:39,035 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:48:39,035 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:48:39,035 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:48:39,036 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 20:48:39,036 INFO L128 BoogieDeclarations]: Found specification of procedure h5 [2018-01-24 20:48:39,036 INFO L128 BoogieDeclarations]: Found specification of procedure g5 [2018-01-24 20:48:39,036 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 20:48:39,036 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:48:39,036 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:48:39,037 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:48:39,185 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:48:39,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:48:39 BoogieIcfgContainer [2018-01-24 20:48:39,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:48:39,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:48:39,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:48:39,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:48:39,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:48:38" (1/3) ... [2018-01-24 20:48:39,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2b7416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:48:39, skipping insertion in model container [2018-01-24 20:48:39,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:48:38" (2/3) ... [2018-01-24 20:48:39,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2b7416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:48:39, skipping insertion in model container [2018-01-24 20:48:39,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:48:39" (3/3) ... [2018-01-24 20:48:39,192 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test5_true-valid-memsafety_true-termination.i [2018-01-24 20:48:39,199 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:48:39,205 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-24 20:48:39,246 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:48:39,246 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:48:39,247 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:48:39,247 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:48:39,247 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:48:39,247 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:48:39,247 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:48:39,247 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:48:39,248 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:48:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-01-24 20:48:39,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:48:39,278 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:48:39,279 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-24 20:48:39,279 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-24 20:48:39,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1224818119, now seen corresponding path program 1 times [2018-01-24 20:48:39,287 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:48:39,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:39,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:48:39,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:39,337 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:48:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:48:39,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:48:39,578 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-24 20:48:39,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:48:39,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:48:39,581 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:48:39,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 20:48:39,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 20:48:39,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 20:48:39,601 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 9 states. [2018-01-24 20:48:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:48:39,788 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-01-24 20:48:39,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:48:39,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 20:48:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:48:39,802 INFO L225 Difference]: With dead ends: 49 [2018-01-24 20:48:39,802 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 20:48:39,805 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-24 20:48:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 20:48:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-01-24 20:48:39,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 20:48:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-24 20:48:39,838 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 20 [2018-01-24 20:48:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:48:39,838 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-24 20:48:39,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 20:48:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-24 20:48:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:48:39,839 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:48:39,840 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-24 20:48:39,840 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-24 20:48:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1224818118, now seen corresponding path program 1 times [2018-01-24 20:48:39,840 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:48:39,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:39,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:48:39,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:39,843 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:48:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:48:39,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:48:39,989 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-24 20:48:39,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:48:39,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:48:39,989 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:48:39,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 20:48:39,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 20:48:39,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 20:48:39,992 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 9 states. [2018-01-24 20:48:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:48:40,073 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-01-24 20:48:40,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:48:40,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 20:48:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:48:40,077 INFO L225 Difference]: With dead ends: 47 [2018-01-24 20:48:40,077 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 20:48:40,078 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-24 20:48:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 20:48:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-01-24 20:48:40,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 20:48:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-01-24 20:48:40,090 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 20 [2018-01-24 20:48:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:48:40,090 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-01-24 20:48:40,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 20:48:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-01-24 20:48:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:48:40,092 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:48:40,092 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-24 20:48:40,092 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-24 20:48:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1045905065, now seen corresponding path program 1 times [2018-01-24 20:48:40,092 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:48:40,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:40,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:48:40,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:40,095 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:48:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:48:40,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:48:40,244 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-24 20:48:40,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:48:40,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 20:48:40,245 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:48:40,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:48:40,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:48:40,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:48:40,246 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 10 states. [2018-01-24 20:48:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:48:40,348 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-01-24 20:48:40,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 20:48:40,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 20:48:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:48:40,350 INFO L225 Difference]: With dead ends: 42 [2018-01-24 20:48:40,350 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 20:48:40,351 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-24 20:48:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 20:48:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 20:48:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 20:48:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-01-24 20:48:40,358 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 22 [2018-01-24 20:48:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:48:40,358 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-01-24 20:48:40,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:48:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-01-24 20:48:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:48:40,359 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:48:40,360 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-24 20:48:40,360 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-24 20:48:40,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1045905064, now seen corresponding path program 1 times [2018-01-24 20:48:40,360 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:48:40,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:40,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:48:40,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:40,362 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:48:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:48:40,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:48:40,480 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-24 20:48:40,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:48:40,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 20:48:40,481 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:48:40,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:48:40,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:48:40,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:48:40,482 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2018-01-24 20:48:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:48:40,644 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-01-24 20:48:40,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:48:40,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 20:48:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:48:40,646 INFO L225 Difference]: With dead ends: 45 [2018-01-24 20:48:40,646 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 20:48:40,646 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-24 20:48:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 20:48:40,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2018-01-24 20:48:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-24 20:48:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-01-24 20:48:40,650 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2018-01-24 20:48:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:48:40,651 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-01-24 20:48:40,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:48:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-01-24 20:48:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 20:48:40,652 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:48:40,652 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-24 20:48:40,652 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-24 20:48:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1043029204, now seen corresponding path program 1 times [2018-01-24 20:48:40,652 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:48:40,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:40,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:48:40,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:40,654 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:48:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:48:40,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:48:40,707 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-24 20:48:40,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:48:40,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:48:40,708 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:48:40,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:48:40,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:48:40,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:48:40,709 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 3 states. [2018-01-24 20:48:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:48:40,732 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-24 20:48:40,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:48:40,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-24 20:48:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:48:40,734 INFO L225 Difference]: With dead ends: 41 [2018-01-24 20:48:40,734 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 20:48:40,734 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-24 20:48:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 20:48:40,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 20:48:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 20:48:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 20:48:40,746 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2018-01-24 20:48:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:48:40,746 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 20:48:40,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:48:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 20:48:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 20:48:40,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:48:40,748 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-24 20:48:40,748 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-24 20:48:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1685081515, now seen corresponding path program 1 times [2018-01-24 20:48:40,748 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:48:40,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:40,749 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:48:40,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:40,749 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:48:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:48:40,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:48:40,860 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-24 20:48:40,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:48:40,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 20:48:40,866 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:48:40,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:48:40,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:48:40,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:48:40,867 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-01-24 20:48:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:48:40,995 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-24 20:48:40,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 20:48:40,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-01-24 20:48:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:48:40,996 INFO L225 Difference]: With dead ends: 41 [2018-01-24 20:48:40,997 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 20:48:40,997 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-24 20:48:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 20:48:41,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-01-24 20:48:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-24 20:48:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-01-24 20:48:41,002 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-01-24 20:48:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:48:41,002 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-01-24 20:48:41,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:48:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-01-24 20:48:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 20:48:41,003 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:48:41,003 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-24 20:48:41,004 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-24 20:48:41,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1527636810, now seen corresponding path program 1 times [2018-01-24 20:48:41,004 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:48:41,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:41,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:48:41,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:41,006 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:48:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:48:41,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:48:41,088 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-24 20:48:41,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:48:41,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 20:48:41,089 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:48:41,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:48:41,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:48:41,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:48:41,090 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 10 states. [2018-01-24 20:48:41,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:48:41,302 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2018-01-24 20:48:41,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:48:41,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-24 20:48:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:48:41,303 INFO L225 Difference]: With dead ends: 34 [2018-01-24 20:48:41,303 INFO L226 Difference]: Without dead ends: 28 [2018-01-24 20:48:41,304 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-24 20:48:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-24 20:48:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-01-24 20:48:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-24 20:48:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2018-01-24 20:48:41,309 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 26 [2018-01-24 20:48:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:48:41,310 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2018-01-24 20:48:41,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:48:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2018-01-24 20:48:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 20:48:41,311 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:48:41,311 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-24 20:48:41,311 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-01-24 20:48:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash -228650675, now seen corresponding path program 1 times [2018-01-24 20:48:41,312 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:48:41,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:41,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:48:41,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:48:41,313 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:48:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:48:41,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:48:41,519 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-24 20:48:41,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:48:41,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 20:48:41,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:48:41,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 20:48:41,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 20:48:41,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 20:48:41,520 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 11 states. [2018-01-24 20:48:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:48:41,648 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2018-01-24 20:48:41,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 20:48:41,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-01-24 20:48:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:48:41,698 INFO L225 Difference]: With dead ends: 28 [2018-01-24 20:48:41,698 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 20:48:41,699 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-24 20:48:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 20:48:41,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 20:48:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 20:48:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 20:48:41,699 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-24 20:48:41,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:48:41,700 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 20:48:41,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 20:48:41,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 20:48:41,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 20:48:41,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 20:48:41,776 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 20:48:41,777 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-24 20:48:41,777 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-24 20:48:41,777 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-24 20:48:41,777 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-24 20:48:41,777 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-24 20:48:41,777 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1451) no Hoare annotation was computed. [2018-01-24 20:48:41,777 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1451) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 20:48:41,777 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1451) no Hoare annotation was computed. [2018-01-24 20:48:41,777 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1451) the Hoare annotation is: true [2018-01-24 20:48:41,777 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1451) no Hoare annotation was computed. [2018-01-24 20:48:41,777 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1451) the Hoare annotation is: true [2018-01-24 20:48:41,777 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1451) no Hoare annotation was computed. [2018-01-24 20:48:41,778 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1449 1451) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 20:48:41,778 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1449 1451) no Hoare annotation was computed. [2018-01-24 20:48:41,778 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1449 1451) no Hoare annotation was computed. [2018-01-24 20:48:41,778 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1449 1451) no Hoare annotation was computed. [2018-01-24 20:48:41,778 INFO L401 ceAbstractionStarter]: For program point L1434(line 1434) no Hoare annotation was computed. [2018-01-24 20:48:41,778 INFO L401 ceAbstractionStarter]: For program point h5EXIT(lines 1433 1436) no Hoare annotation was computed. [2018-01-24 20:48:41,778 INFO L397 ceAbstractionStarter]: At program point h5ENTRY(lines 1433 1436) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 20:48:41,778 INFO L401 ceAbstractionStarter]: For program point h5FINAL(lines 1433 1436) no Hoare annotation was computed. [2018-01-24 20:48:41,778 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1444 1447) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 20:48:41,778 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1444 1447) no Hoare annotation was computed. [2018-01-24 20:48:41,779 INFO L401 ceAbstractionStarter]: For program point L1445(line 1445) no Hoare annotation was computed. [2018-01-24 20:48:41,779 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-24 20:48:41,779 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1444 1447) no Hoare annotation was computed. [2018-01-24 20:48:41,779 INFO L401 ceAbstractionStarter]: For program point g5Err1RequiresViolation(lines 1 1451) no Hoare annotation was computed. [2018-01-24 20:48:41,779 INFO L401 ceAbstractionStarter]: For program point g5EXIT(lines 1438 1442) no Hoare annotation was computed. [2018-01-24 20:48:41,779 INFO L401 ceAbstractionStarter]: For program point L1439(lines 1439 1441) no Hoare annotation was computed. [2018-01-24 20:48:41,779 INFO L401 ceAbstractionStarter]: For program point g5Err0RequiresViolation(lines 1 1451) no Hoare annotation was computed. [2018-01-24 20:48:41,780 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-24 20:48:41,780 INFO L401 ceAbstractionStarter]: For program point L1439'(lines 1439 1441) no Hoare annotation was computed. [2018-01-24 20:48:41,780 INFO L401 ceAbstractionStarter]: For program point L1440(line 1440) no Hoare annotation was computed. [2018-01-24 20:48:41,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:48:41 BoogieIcfgContainer [2018-01-24 20:48:41,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:48:41,785 INFO L168 Benchmark]: Toolchain (without parser) took 3053.40 ms. Allocated memory was 305.7 MB in the beginning and 475.5 MB in the end (delta: 169.9 MB). Free memory was 263.0 MB in the beginning and 341.0 MB in the end (delta: -78.0 MB). Peak memory consumption was 91.8 MB. Max. memory is 5.3 GB. [2018-01-24 20:48:41,786 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:48:41,786 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.18 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 250.7 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. [2018-01-24 20:48:41,786 INFO L168 Benchmark]: Boogie Preprocessor took 30.65 ms. Allocated memory is still 305.7 MB. Free memory was 250.7 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:48:41,787 INFO L168 Benchmark]: RCFGBuilder took 202.82 ms. Allocated memory is still 305.7 MB. Free memory was 248.7 MB in the beginning and 235.0 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 5.3 GB. [2018-01-24 20:48:41,787 INFO L168 Benchmark]: TraceAbstraction took 2596.93 ms. Allocated memory was 305.7 MB in the beginning and 475.5 MB in the end (delta: 169.9 MB). Free memory was 235.0 MB in the beginning and 341.0 MB in the end (delta: -106.0 MB). Peak memory consumption was 63.9 MB. Max. memory is 5.3 GB. [2018-01-24 20:48:41,788 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.18 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 250.7 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.65 ms. Allocated memory is still 305.7 MB. Free memory was 250.7 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 202.82 ms. Allocated memory is still 305.7 MB. Free memory was 248.7 MB in the beginning and 235.0 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2596.93 ms. Allocated memory was 305.7 MB in the beginning and 475.5 MB in the end (delta: 169.9 MB). Free memory was 235.0 MB in the beginning and 341.0 MB in the end (delta: -106.0 MB). Peak memory consumption was 63.9 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.5s 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.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s 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, 0.9s 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_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-48-41-797.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-48-41-797.csv Received shutdown request...