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/memsafety/test-0019_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:11:22,557 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:11:22,567 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:11:22,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:11:22,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:11:22,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:11:22,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:11:22,583 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:11:22,584 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:11:22,585 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:11:22,586 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:11:22,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:11:22,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:11:22,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:11:22,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:11:22,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:11:22,594 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:11:22,596 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:11:22,597 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:11:22,599 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:11:22,601 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:11:22,601 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:11:22,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:11:22,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:11:22,603 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:11:22,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:11:22,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:11:22,605 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:11:22,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:11:22,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:11:22,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:11:22,607 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:11:22,616 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:11:22,617 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:11:22,617 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:11:22,618 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:11:22,618 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:11:22,618 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:11:22,618 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:11:22,618 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:11:22,619 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:11:22,619 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:11:22,619 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:11:22,620 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:11:22,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:11:22,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:11:22,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:11:22,620 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:11:22,621 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:11:22,621 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:11:22,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:11:22,621 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:11:22,621 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:11:22,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:11:22,622 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:11:22,622 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:11:22,622 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:11:22,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:11:22,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:11:22,623 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:11:22,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:11:22,623 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:11:22,623 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:11:22,624 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:11:22,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:11:22,624 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:11:22,624 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:11:22,625 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:11:22,625 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:11:22,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:11:22,673 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:11:22,677 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:11:22,679 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:11:22,679 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:11:22,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0019_true-valid-memsafety_true-termination.i [2018-01-24 20:11:22,857 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:11:22,863 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:11:22,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:11:22,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:11:22,869 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:11:22,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:11:22" (1/1) ... [2018-01-24 20:11:22,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb77e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:11:22, skipping insertion in model container [2018-01-24 20:11:22,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:11:22" (1/1) ... [2018-01-24 20:11:22,885 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:11:22,923 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:11:23,027 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:11:23,043 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:11:23,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:11:23 WrapperNode [2018-01-24 20:11:23,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:11:23,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:11:23,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:11:23,050 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:11:23,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:11:23" (1/1) ... [2018-01-24 20:11:23,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:11:23" (1/1) ... [2018-01-24 20:11:23,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:11:23" (1/1) ... [2018-01-24 20:11:23,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:11:23" (1/1) ... [2018-01-24 20:11:23,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:11:23" (1/1) ... [2018-01-24 20:11:23,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:11:23" (1/1) ... [2018-01-24 20:11:23,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:11:23" (1/1) ... [2018-01-24 20:11:23,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:11:23,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:11:23,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:11:23,082 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:11:23,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:11:23" (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:11:23,126 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:11:23,126 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:11:23,126 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-01-24 20:11:23,127 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-01-24 20:11:23,127 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:11:23,127 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:11:23,127 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:11:23,127 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:11:23,127 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:11:23,127 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:11:23,127 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:11:23,127 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:11:23,127 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-01-24 20:11:23,128 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-01-24 20:11:23,128 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:11:23,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:11:23,128 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:11:23,312 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:11:23,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:11:23 BoogieIcfgContainer [2018-01-24 20:11:23,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:11:23,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:11:23,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:11:23,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:11:23,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:11:22" (1/3) ... [2018-01-24 20:11:23,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574770da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:11:23, skipping insertion in model container [2018-01-24 20:11:23,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:11:23" (2/3) ... [2018-01-24 20:11:23,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574770da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:11:23, skipping insertion in model container [2018-01-24 20:11:23,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:11:23" (3/3) ... [2018-01-24 20:11:23,320 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0019_true-valid-memsafety_true-termination.i [2018-01-24 20:11:23,329 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:11:23,336 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 20:11:23,385 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:11:23,385 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:11:23,386 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:11:23,386 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:11:23,386 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:11:23,386 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:11:23,386 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:11:23,386 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:11:23,387 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:11:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-24 20:11:23,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 20:11:23,413 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:11:23,414 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:11:23,414 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-24 20:11:23,419 INFO L82 PathProgramCache]: Analyzing trace with hash 345440703, now seen corresponding path program 1 times [2018-01-24 20:11:23,421 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:11:23,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:23,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:11:23,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:23,461 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:11:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:11:23,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:11:23,687 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:11:23,689 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:11:23,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:11:23,689 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:11:23,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:11:23,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:11:23,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:11:23,704 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2018-01-24 20:11:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:11:23,951 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-01-24 20:11:23,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:11:23,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 20:11:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:11:23,963 INFO L225 Difference]: With dead ends: 43 [2018-01-24 20:11:23,963 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 20:11:23,966 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:11:23,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 20:11:23,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-24 20:11:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 20:11:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-01-24 20:11:23,997 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 10 [2018-01-24 20:11:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:11:23,997 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-01-24 20:11:23,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:11:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-01-24 20:11:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 20:11:23,998 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:11:23,998 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:11:23,998 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-24 20:11:23,999 INFO L82 PathProgramCache]: Analyzing trace with hash 345440704, now seen corresponding path program 1 times [2018-01-24 20:11:23,999 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:11:24,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:24,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:11:24,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:24,000 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:11:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:11:24,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:11:24,125 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:11:24,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:11:24,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:11:24,126 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:11:24,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:11:24,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:11:24,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:11:24,128 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 6 states. [2018-01-24 20:11:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:11:24,265 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-01-24 20:11:24,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:11:24,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-01-24 20:11:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:11:24,267 INFO L225 Difference]: With dead ends: 36 [2018-01-24 20:11:24,267 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 20:11:24,268 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:11:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 20:11:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-24 20:11:24,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-24 20:11:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-01-24 20:11:24,273 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 10 [2018-01-24 20:11:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:11:24,274 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-01-24 20:11:24,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:11:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-01-24 20:11:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:11:24,275 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:11:24,275 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:11:24,275 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-24 20:11:24,275 INFO L82 PathProgramCache]: Analyzing trace with hash 569818482, now seen corresponding path program 1 times [2018-01-24 20:11:24,275 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:11:24,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:24,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:11:24,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:24,277 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:11:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:11:24,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:11:24,473 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:11:24,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:11:24,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 20:11:24,473 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:11:24,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:11:24,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:11:24,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:11:24,474 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 10 states. [2018-01-24 20:11:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:11:24,565 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-01-24 20:11:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 20:11:24,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-01-24 20:11:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:11:24,567 INFO L225 Difference]: With dead ends: 32 [2018-01-24 20:11:24,567 INFO L226 Difference]: Without dead ends: 31 [2018-01-24 20:11:24,568 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-24 20:11:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-24 20:11:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-24 20:11:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 20:11:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-01-24 20:11:24,572 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 20 [2018-01-24 20:11:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:11:24,572 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-01-24 20:11:24,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:11:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-01-24 20:11:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:11:24,573 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:11:24,573 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:11:24,573 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-24 20:11:24,573 INFO L82 PathProgramCache]: Analyzing trace with hash 569818483, now seen corresponding path program 1 times [2018-01-24 20:11:24,573 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:11:24,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:24,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:11:24,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:24,575 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:11:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:11:24,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:11:24,743 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:11:24,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:11:24,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 20:11:24,743 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:11:24,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:11:24,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:11:24,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:11:24,744 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 10 states. [2018-01-24 20:11:24,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:11:24,865 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-01-24 20:11:24,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:11:24,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-01-24 20:11:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:11:24,867 INFO L225 Difference]: With dead ends: 34 [2018-01-24 20:11:24,867 INFO L226 Difference]: Without dead ends: 33 [2018-01-24 20:11:24,867 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-24 20:11:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-24 20:11:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-01-24 20:11:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-24 20:11:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-01-24 20:11:24,872 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 20 [2018-01-24 20:11:24,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:11:24,873 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-01-24 20:11:24,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:11:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-01-24 20:11:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 20:11:24,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:11:24,874 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:11:24,874 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-24 20:11:24,874 INFO L82 PathProgramCache]: Analyzing trace with hash 484503765, now seen corresponding path program 1 times [2018-01-24 20:11:24,874 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:11:24,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:24,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:11:24,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:24,875 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:11:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:11:24,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:11:25,049 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:11:25,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:11:25,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 20:11:25,050 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:11:25,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:11:25,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:11:25,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:11:25,050 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 10 states. [2018-01-24 20:11:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:11:25,144 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-01-24 20:11:25,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:11:25,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-01-24 20:11:25,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:11:25,145 INFO L225 Difference]: With dead ends: 30 [2018-01-24 20:11:25,145 INFO L226 Difference]: Without dead ends: 29 [2018-01-24 20:11:25,146 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-01-24 20:11:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-24 20:11:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-24 20:11:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-24 20:11:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-01-24 20:11:25,150 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 21 [2018-01-24 20:11:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:11:25,151 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-01-24 20:11:25,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:11:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-01-24 20:11:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 20:11:25,152 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:11:25,152 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:11:25,152 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-24 20:11:25,152 INFO L82 PathProgramCache]: Analyzing trace with hash 484503766, now seen corresponding path program 1 times [2018-01-24 20:11:25,152 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:11:25,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:25,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:11:25,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:25,153 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:11:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:11:25,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:11:25,386 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 16 DAG size of output 11 [2018-01-24 20:11:25,647 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:11:25,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:11:25,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-24 20:11:25,647 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:11:25,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 20:11:25,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 20:11:25,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-01-24 20:11:25,648 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-01-24 20:11:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:11:25,996 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-01-24 20:11:25,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 20:11:25,996 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-01-24 20:11:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:11:25,997 INFO L225 Difference]: With dead ends: 32 [2018-01-24 20:11:25,997 INFO L226 Difference]: Without dead ends: 31 [2018-01-24 20:11:25,998 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-01-24 20:11:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-24 20:11:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-01-24 20:11:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-24 20:11:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-01-24 20:11:26,003 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 21 [2018-01-24 20:11:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:11:26,003 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-01-24 20:11:26,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 20:11:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-01-24 20:11:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 20:11:26,004 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:11:26,005 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:11:26,005 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-24 20:11:26,005 INFO L82 PathProgramCache]: Analyzing trace with hash -997094437, now seen corresponding path program 1 times [2018-01-24 20:11:26,005 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:11:26,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:26,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:11:26,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:26,007 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:11:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:11:26,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:11:26,182 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:11:26,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:11:26,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 20:11:26,184 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:11:26,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 20:11:26,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 20:11:26,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-24 20:11:26,184 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 13 states. [2018-01-24 20:11:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:11:26,369 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2018-01-24 20:11:26,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 20:11:26,370 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-01-24 20:11:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:11:26,371 INFO L225 Difference]: With dead ends: 35 [2018-01-24 20:11:26,371 INFO L226 Difference]: Without dead ends: 28 [2018-01-24 20:11:26,371 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-01-24 20:11:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-24 20:11:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-01-24 20:11:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-24 20:11:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2018-01-24 20:11:26,376 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 25 [2018-01-24 20:11:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:11:26,376 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2018-01-24 20:11:26,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 20:11:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2018-01-24 20:11:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 20:11:26,377 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:11:26,377 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:11:26,377 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-24 20:11:26,377 INFO L82 PathProgramCache]: Analyzing trace with hash -502821665, now seen corresponding path program 1 times [2018-01-24 20:11:26,378 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:11:26,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:26,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:11:26,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:11:26,379 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:11:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:11:26,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:11:27,174 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:11:27,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:11:27,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 20:11:27,174 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:11:27,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 20:11:27,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 20:11:27,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-01-24 20:11:27,175 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 17 states. [2018-01-24 20:11:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:11:27,966 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2018-01-24 20:11:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 20:11:27,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-01-24 20:11:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:11:27,966 INFO L225 Difference]: With dead ends: 28 [2018-01-24 20:11:27,967 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 20:11:27,967 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2018-01-24 20:11:27,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 20:11:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 20:11:27,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 20:11:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 20:11:27,968 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-24 20:11:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:11:27,968 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 20:11:27,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 20:11:27,968 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 20:11:27,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 20:11:27,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 20:11:28,168 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,168 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 642) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 20:11:28,168 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,168 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 642) the Hoare annotation is: true [2018-01-24 20:11:28,169 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,169 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 642) the Hoare annotation is: true [2018-01-24 20:11:28,169 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,169 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr1RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,169 INFO L401 ceAbstractionStarter]: For program point alloc_dataEXIT(lines 623 627) no Hoare annotation was computed. [2018-01-24 20:11:28,169 INFO L401 ceAbstractionStarter]: For program point L625'(line 625) no Hoare annotation was computed. [2018-01-24 20:11:28,169 INFO L401 ceAbstractionStarter]: For program point alloc_dataFINAL(lines 623 627) no Hoare annotation was computed. [2018-01-24 20:11:28,169 INFO L397 ceAbstractionStarter]: At program point alloc_dataENTRY(lines 623 627) the Hoare annotation is: (or (not (= 0 |alloc_data_#in~pdata.offset|)) (not (= (select |old(#valid)| |alloc_data_#in~pdata.base|) 1)) (and (= |#valid| |old(#valid)|) (= 8 (select |#length| |alloc_data_#in~pdata.base|))) (not (= 8 (select |old(#length)| |alloc_data_#in~pdata.base|)))) [2018-01-24 20:11:28,169 INFO L401 ceAbstractionStarter]: For program point L625''(line 625) no Hoare annotation was computed. [2018-01-24 20:11:28,169 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr0RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,169 INFO L401 ceAbstractionStarter]: For program point L626(line 626) no Hoare annotation was computed. [2018-01-24 20:11:28,169 INFO L401 ceAbstractionStarter]: For program point L625(line 625) no Hoare annotation was computed. [2018-01-24 20:11:28,170 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr3RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,170 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr2RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,170 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,170 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,170 INFO L401 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. [2018-01-24 20:11:28,170 INFO L401 ceAbstractionStarter]: For program point L640''(line 640) no Hoare annotation was computed. [2018-01-24 20:11:28,170 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 637 642) no Hoare annotation was computed. [2018-01-24 20:11:28,170 INFO L397 ceAbstractionStarter]: At program point L640'(line 640) the Hoare annotation is: (let ((.cse4 (store |#valid| |main_~#data~5.base| 0)) (.cse3 (select |#memory_$Pointer$.base| |main_~#data~5.base|)) (.cse1 (+ |main_~#data~5.offset| 4))) (let ((.cse2 (store .cse4 (select .cse3 .cse1) 0)) (.cse0 (select |#memory_$Pointer$.offset| |main_~#data~5.base|))) (and (= 1 (select |#valid| |main_#t~mem5.base|)) (= 0 (select .cse0 .cse1)) (= (store .cse2 |main_#t~mem4.base| 0) |old(#valid)|) (not (= |main_~#data~5.base| |main_#t~mem5.base|)) (not (= |main_~#data~5.base| |main_#t~mem4.base|)) (= 1 (select |#valid| |main_~#data~5.base|)) (= 1 (select |#valid| |main_#t~mem4.base|)) (= 0 |main_#t~mem4.offset|) (= (store .cse2 (select .cse3 |main_~#data~5.offset|) 0) |old(#valid)|) (= (store (store .cse4 |main_#t~mem5.base| 0) |main_#t~mem4.base| 0) |old(#valid)|) (= 8 (select |#length| |main_~#data~5.base|)) (not (= |main_#t~mem4.base| |main_#t~mem5.base|)) (not (= 0 |main_#t~mem4.base|)) (not (= 0 |main_#t~mem5.base|)) (= 0 (select .cse0 |main_~#data~5.offset|)) (= 0 |main_~#data~5.offset|) (= 0 |main_#t~mem5.offset|)))) [2018-01-24 20:11:28,171 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 637 642) no Hoare annotation was computed. [2018-01-24 20:11:28,171 INFO L397 ceAbstractionStarter]: At program point L638(line 638) the Hoare annotation is: (and (= 8 (select |#length| |main_~#data~5.base|)) (= (store |#valid| |main_~#data~5.base| 0) |old(#valid)|) (= 1 (select |#valid| |main_~#data~5.base|)) (= 0 |main_~#data~5.offset|)) [2018-01-24 20:11:28,171 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,171 INFO L401 ceAbstractionStarter]: For program point L638''(line 638) no Hoare annotation was computed. [2018-01-24 20:11:28,171 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 637 642) no Hoare annotation was computed. [2018-01-24 20:11:28,171 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 637 642) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 20:11:28,171 INFO L401 ceAbstractionStarter]: For program point L638'(line 638) no Hoare annotation was computed. [2018-01-24 20:11:28,171 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-24 20:11:28,172 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,172 INFO L401 ceAbstractionStarter]: For program point free_dataErr1RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,172 INFO L401 ceAbstractionStarter]: For program point free_dataErr0RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,172 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-24 20:11:28,172 INFO L397 ceAbstractionStarter]: At program point free_dataENTRY(lines 628 636) the Hoare annotation is: (or (= |#valid| |old(#valid)|) (= 0 |free_data_#in~data.lo.base|) (not (= (select |old(#valid)| |free_data_#in~data.hi.base|) 1)) (not (= |free_data_#in~data.hi.offset| 0)) (not (= 0 |free_data_#in~data.lo.offset|)) (not (= 1 (select |old(#valid)| |free_data_#in~data.lo.base|)))) [2018-01-24 20:11:28,172 INFO L401 ceAbstractionStarter]: For program point free_dataFINAL(lines 628 636) no Hoare annotation was computed. [2018-01-24 20:11:28,172 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-24 20:11:28,172 INFO L401 ceAbstractionStarter]: For program point L632(lines 632 633) no Hoare annotation was computed. [2018-01-24 20:11:28,172 INFO L401 ceAbstractionStarter]: For program point free_dataErr2RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,172 INFO L401 ceAbstractionStarter]: For program point free_dataErr3RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-24 20:11:28,172 INFO L401 ceAbstractionStarter]: For program point free_dataEXIT(lines 628 636) no Hoare annotation was computed. [2018-01-24 20:11:28,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:11:28 BoogieIcfgContainer [2018-01-24 20:11:28,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:11:28,176 INFO L168 Benchmark]: Toolchain (without parser) took 5318.62 ms. Allocated memory was 305.7 MB in the beginning and 543.7 MB in the end (delta: 238.0 MB). Free memory was 264.0 MB in the beginning and 386.5 MB in the end (delta: -122.5 MB). Peak memory consumption was 115.5 MB. Max. memory is 5.3 GB. [2018-01-24 20:11:28,177 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:11:28,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.69 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 252.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 20:11:28,178 INFO L168 Benchmark]: Boogie Preprocessor took 31.90 ms. Allocated memory is still 305.7 MB. Free memory was 252.9 MB in the beginning and 250.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 20:11:28,178 INFO L168 Benchmark]: RCFGBuilder took 231.15 ms. Allocated memory is still 305.7 MB. Free memory was 250.8 MB in the beginning and 234.2 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-24 20:11:28,178 INFO L168 Benchmark]: TraceAbstraction took 4861.92 ms. Allocated memory was 305.7 MB in the beginning and 543.7 MB in the end (delta: 238.0 MB). Free memory was 234.2 MB in the beginning and 386.5 MB in the end (delta: -152.2 MB). Peak memory consumption was 85.8 MB. Max. memory is 5.3 GB. [2018-01-24 20:11:28,180 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 185.69 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 252.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.90 ms. Allocated memory is still 305.7 MB. Free memory was 252.9 MB in the beginning and 250.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 231.15 ms. Allocated memory is still 305.7 MB. Free memory was 250.8 MB in the beginning and 234.2 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4861.92 ms. Allocated memory was 305.7 MB in the beginning and 543.7 MB in the end (delta: 238.0 MB). Free memory was 234.2 MB in the beginning and 386.5 MB in the end (delta: -152.2 MB). Peak memory consumption was 85.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: 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 - 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 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 13 error locations. SAFE Result, 4.7s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 150 SDslu, 679 SDs, 0 SdLazy, 926 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 8 NumberOfFragments, 199 HoareAnnotationTreeSize, 8 FomulaSimplifications, 51 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 145 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 36431 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/test-0019_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-11-28-188.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-11-28-188.csv Received shutdown request...