java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/memsafety/test-0019_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:00:05,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:00:05,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:00:05,821 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:00:05,821 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:00:05,822 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:00:05,824 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:00:05,826 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:00:05,828 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:00:05,829 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:00:05,830 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:00:05,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:00:05,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:00:05,833 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:00:05,834 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:00:05,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:00:05,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:00:05,841 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:00:05,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:00:05,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:00:05,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:00:05,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:00:05,847 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:00:05,848 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:00:05,849 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:00:05,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:00:05,851 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:00:05,852 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:00:05,852 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:00:05,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:00:05,853 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:00:05,853 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:00:05,865 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:00:05,865 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:00:05,866 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:00:05,866 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:00:05,867 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:00:05,867 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:00:05,867 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:00:05,867 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:00:05,867 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:00:05,868 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:00:05,868 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:00:05,869 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:00:05,869 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:00:05,869 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:00:05,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:00:05,869 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:00:05,869 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:00:05,870 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:00:05,870 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:00:05,870 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:00:05,870 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:00:05,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:00:05,871 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:00:05,871 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:00:05,871 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:00:05,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:00:05,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:00:05,872 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:00:05,872 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:00:05,872 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:00:05,872 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:00:05,873 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:00:05,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:00:05,873 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:00:05,873 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:00:05,874 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:00:05,874 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:00:05,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:00:05,943 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:00:05,948 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:00:05,950 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:00:05,951 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:00:05,951 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-25 03:00:06,194 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:00:06,200 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:00:06,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:00:06,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:00:06,209 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:00:06,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:00:06" (1/1) ... [2018-01-25 03:00:06,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd0ac53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:06, skipping insertion in model container [2018-01-25 03:00:06,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:00:06" (1/1) ... [2018-01-25 03:00:06,257 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:00:06,322 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:00:06,466 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:00:06,501 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:00:06,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:06 WrapperNode [2018-01-25 03:00:06,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:00:06,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:00:06,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:00:06,522 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:00:06,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:06" (1/1) ... [2018-01-25 03:00:06,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:06" (1/1) ... [2018-01-25 03:00:06,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:06" (1/1) ... [2018-01-25 03:00:06,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:06" (1/1) ... [2018-01-25 03:00:06,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:06" (1/1) ... [2018-01-25 03:00:06,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:06" (1/1) ... [2018-01-25 03:00:06,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:06" (1/1) ... [2018-01-25 03:00:06,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:00:06,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:00:06,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:00:06,591 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:00:06,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:06" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:00:06,690 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:00:06,690 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:00:06,691 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-01-25 03:00:06,691 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-01-25 03:00:06,694 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:00:06,695 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:00:06,695 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:00:06,695 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:00:06,695 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:00:06,695 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:00:06,695 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:00:06,695 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:00:06,696 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-01-25 03:00:06,696 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-01-25 03:00:06,696 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:00:06,696 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:00:06,696 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:00:07,027 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:00:07,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:00:07 BoogieIcfgContainer [2018-01-25 03:00:07,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:00:07,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:00:07,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:00:07,032 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:00:07,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:00:06" (1/3) ... [2018-01-25 03:00:07,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c379269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:00:07, skipping insertion in model container [2018-01-25 03:00:07,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:00:06" (2/3) ... [2018-01-25 03:00:07,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c379269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:00:07, skipping insertion in model container [2018-01-25 03:00:07,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:00:07" (3/3) ... [2018-01-25 03:00:07,038 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0019_true-valid-memsafety_true-termination.i [2018-01-25 03:00:07,047 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:00:07,055 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-25 03:00:07,097 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:00:07,097 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:00:07,097 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:00:07,098 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:00:07,098 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:00:07,098 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:00:07,098 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:00:07,098 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:00:07,099 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:00:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-25 03:00:07,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 03:00:07,128 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:07,130 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:00:07,130 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-25 03:00:07,135 INFO L82 PathProgramCache]: Analyzing trace with hash 345440703, now seen corresponding path program 1 times [2018-01-25 03:00:07,138 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:07,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:07,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:07,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:07,185 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:07,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:00:07,582 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:07,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:00:07,583 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:07,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:00:07,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:00:07,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:00:07,607 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2018-01-25 03:00:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:08,362 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-01-25 03:00:08,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:00:08,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-25 03:00:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:08,397 INFO L225 Difference]: With dead ends: 43 [2018-01-25 03:00:08,398 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 03:00:08,410 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:00:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 03:00:08,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-25 03:00:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 03:00:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-01-25 03:00:08,472 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 10 [2018-01-25 03:00:08,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:08,473 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-01-25 03:00:08,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:00:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-01-25 03:00:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 03:00:08,475 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:08,475 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:00:08,475 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-25 03:00:08,476 INFO L82 PathProgramCache]: Analyzing trace with hash 345440704, now seen corresponding path program 1 times [2018-01-25 03:00:08,476 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:08,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:08,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:08,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:08,478 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:08,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:00:08,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:08,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:00:08,844 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:08,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:00:08,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:00:08,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:00:08,846 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 6 states. [2018-01-25 03:00:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:09,035 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-01-25 03:00:09,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:00:09,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-01-25 03:00:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:09,037 INFO L225 Difference]: With dead ends: 36 [2018-01-25 03:00:09,038 INFO L226 Difference]: Without dead ends: 32 [2018-01-25 03:00:09,039 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:00:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-25 03:00:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-25 03:00:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 03:00:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-01-25 03:00:09,045 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 10 [2018-01-25 03:00:09,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:09,045 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-01-25 03:00:09,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:00:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-01-25 03:00:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:00:09,046 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:09,047 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:00:09,047 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-25 03:00:09,047 INFO L82 PathProgramCache]: Analyzing trace with hash 569818482, now seen corresponding path program 1 times [2018-01-25 03:00:09,047 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:09,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:09,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:09,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:09,049 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:09,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:00:09,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:09,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:00:09,271 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:09,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:00:09,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:00:09,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:00:09,272 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 10 states. [2018-01-25 03:00:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:09,392 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-01-25 03:00:09,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:00:09,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-01-25 03:00:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:09,394 INFO L225 Difference]: With dead ends: 32 [2018-01-25 03:00:09,394 INFO L226 Difference]: Without dead ends: 31 [2018-01-25 03:00:09,394 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-25 03:00:09,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-25 03:00:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-25 03:00:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-25 03:00:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-01-25 03:00:09,401 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 20 [2018-01-25 03:00:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:09,401 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-01-25 03:00:09,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:00:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-01-25 03:00:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:00:09,403 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:09,403 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:00:09,403 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-25 03:00:09,403 INFO L82 PathProgramCache]: Analyzing trace with hash 569818483, now seen corresponding path program 1 times [2018-01-25 03:00:09,403 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:09,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:09,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:09,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:09,405 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:09,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:00:09,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:09,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:00:09,590 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:09,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:00:09,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:00:09,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:00:09,591 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 10 states. [2018-01-25 03:00:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:09,706 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-01-25 03:00:09,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:00:09,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-01-25 03:00:09,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:09,708 INFO L225 Difference]: With dead ends: 34 [2018-01-25 03:00:09,708 INFO L226 Difference]: Without dead ends: 33 [2018-01-25 03:00:09,708 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-25 03:00:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-25 03:00:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-01-25 03:00:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-25 03:00:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-01-25 03:00:09,713 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 20 [2018-01-25 03:00:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:09,713 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-01-25 03:00:09,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:00:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-01-25 03:00:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 03:00:09,714 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:09,714 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:00:09,714 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-25 03:00:09,714 INFO L82 PathProgramCache]: Analyzing trace with hash 484503765, now seen corresponding path program 1 times [2018-01-25 03:00:09,714 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:09,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:09,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:09,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:09,716 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:09,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:00:09,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:09,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:00:09,917 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:09,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:00:09,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:00:09,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:00:09,918 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 10 states. [2018-01-25 03:00:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:10,009 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-01-25 03:00:10,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:00:10,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-01-25 03:00:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:10,011 INFO L225 Difference]: With dead ends: 30 [2018-01-25 03:00:10,011 INFO L226 Difference]: Without dead ends: 29 [2018-01-25 03:00:10,011 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-25 03:00:10,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-25 03:00:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-25 03:00:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-25 03:00:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-01-25 03:00:10,016 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 21 [2018-01-25 03:00:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:10,017 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-01-25 03:00:10,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:00:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-01-25 03:00:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 03:00:10,018 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:10,018 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:00:10,018 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-25 03:00:10,018 INFO L82 PathProgramCache]: Analyzing trace with hash 484503766, now seen corresponding path program 1 times [2018-01-25 03:00:10,019 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:10,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:10,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:10,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:10,020 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:10,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:00:10,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:10,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-25 03:00:10,695 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:10,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 03:00:10,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 03:00:10,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-01-25 03:00:10,696 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-01-25 03:00:11,038 WARN L146 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 48 DAG size of output 45 [2018-01-25 03:00:11,386 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 33 DAG size of output 30 [2018-01-25 03:00:11,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:11,518 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-01-25 03:00:11,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 03:00:11,519 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-01-25 03:00:11,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:11,519 INFO L225 Difference]: With dead ends: 32 [2018-01-25 03:00:11,519 INFO L226 Difference]: Without dead ends: 31 [2018-01-25 03:00:11,520 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-01-25 03:00:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-25 03:00:11,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-01-25 03:00:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-25 03:00:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-01-25 03:00:11,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 21 [2018-01-25 03:00:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:11,524 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-01-25 03:00:11,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 03:00:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-01-25 03:00:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 03:00:11,524 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:11,524 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:00:11,525 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-25 03:00:11,525 INFO L82 PathProgramCache]: Analyzing trace with hash -997094437, now seen corresponding path program 1 times [2018-01-25 03:00:11,525 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:11,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:11,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:11,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:11,526 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:11,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:00:11,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:11,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-25 03:00:11,884 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:11,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 03:00:11,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 03:00:11,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:00:11,885 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 13 states. [2018-01-25 03:00:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:12,269 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2018-01-25 03:00:12,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 03:00:12,270 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-01-25 03:00:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:12,271 INFO L225 Difference]: With dead ends: 35 [2018-01-25 03:00:12,271 INFO L226 Difference]: Without dead ends: 28 [2018-01-25 03:00:12,271 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:00:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-25 03:00:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-01-25 03:00:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-25 03:00:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2018-01-25 03:00:12,276 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 25 [2018-01-25 03:00:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:12,276 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2018-01-25 03:00:12,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 03:00:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2018-01-25 03:00:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:00:12,277 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:00:12,278 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:00:12,278 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-25 03:00:12,278 INFO L82 PathProgramCache]: Analyzing trace with hash -502821665, now seen corresponding path program 1 times [2018-01-25 03:00:12,278 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:00:12,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:12,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:00:12,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:00:12,279 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:00:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:00:12,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:00:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:00:13,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:00:13,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 03:00:13,080 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:00:13,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 03:00:13,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 03:00:13,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:00:13,081 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 17 states. [2018-01-25 03:00:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:00:13,907 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2018-01-25 03:00:13,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 03:00:13,907 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-01-25 03:00:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:00:13,908 INFO L225 Difference]: With dead ends: 28 [2018-01-25 03:00:13,908 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 03:00:13,909 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-25 03:00:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 03:00:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 03:00:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 03:00:13,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 03:00:13,910 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-25 03:00:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:00:13,910 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 03:00:13,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 03:00:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 03:00:13,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 03:00:13,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 03:00:14,115 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,115 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 642) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:00:14,116 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,116 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 642) the Hoare annotation is: true [2018-01-25 03:00:14,116 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,116 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 642) the Hoare annotation is: true [2018-01-25 03:00:14,116 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,116 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr1RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,116 INFO L401 ceAbstractionStarter]: For program point alloc_dataEXIT(lines 623 627) no Hoare annotation was computed. [2018-01-25 03:00:14,116 INFO L401 ceAbstractionStarter]: For program point L625'(line 625) no Hoare annotation was computed. [2018-01-25 03:00:14,116 INFO L401 ceAbstractionStarter]: For program point alloc_dataFINAL(lines 623 627) no Hoare annotation was computed. [2018-01-25 03:00:14,116 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-25 03:00:14,116 INFO L401 ceAbstractionStarter]: For program point L625''(line 625) no Hoare annotation was computed. [2018-01-25 03:00:14,117 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr0RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,117 INFO L401 ceAbstractionStarter]: For program point L626(line 626) no Hoare annotation was computed. [2018-01-25 03:00:14,117 INFO L401 ceAbstractionStarter]: For program point L625(line 625) no Hoare annotation was computed. [2018-01-25 03:00:14,117 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr3RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,117 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr2RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,117 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,117 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,117 INFO L401 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. [2018-01-25 03:00:14,117 INFO L401 ceAbstractionStarter]: For program point L640''(line 640) no Hoare annotation was computed. [2018-01-25 03:00:14,117 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 637 642) no Hoare annotation was computed. [2018-01-25 03:00:14,118 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-25 03:00:14,118 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 637 642) no Hoare annotation was computed. [2018-01-25 03:00:14,118 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-25 03:00:14,118 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,118 INFO L401 ceAbstractionStarter]: For program point L638''(line 638) no Hoare annotation was computed. [2018-01-25 03:00:14,118 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 637 642) no Hoare annotation was computed. [2018-01-25 03:00:14,119 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 637 642) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:00:14,119 INFO L401 ceAbstractionStarter]: For program point L638'(line 638) no Hoare annotation was computed. [2018-01-25 03:00:14,119 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-25 03:00:14,119 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,119 INFO L401 ceAbstractionStarter]: For program point free_dataErr1RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,119 INFO L401 ceAbstractionStarter]: For program point free_dataErr0RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,119 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-25 03:00:14,119 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-25 03:00:14,119 INFO L401 ceAbstractionStarter]: For program point free_dataFINAL(lines 628 636) no Hoare annotation was computed. [2018-01-25 03:00:14,119 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-25 03:00:14,119 INFO L401 ceAbstractionStarter]: For program point L632(lines 632 633) no Hoare annotation was computed. [2018-01-25 03:00:14,120 INFO L401 ceAbstractionStarter]: For program point free_dataErr2RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,120 INFO L401 ceAbstractionStarter]: For program point free_dataErr3RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-25 03:00:14,120 INFO L401 ceAbstractionStarter]: For program point free_dataEXIT(lines 628 636) no Hoare annotation was computed. [2018-01-25 03:00:14,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:00:14 BoogieIcfgContainer [2018-01-25 03:00:14,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:00:14,124 INFO L168 Benchmark]: Toolchain (without parser) took 7929.59 ms. Allocated memory was 314.0 MB in the beginning and 555.7 MB in the end (delta: 241.7 MB). Free memory was 272.0 MB in the beginning and 377.9 MB in the end (delta: -105.9 MB). Peak memory consumption was 135.8 MB. Max. memory is 5.3 GB. [2018-01-25 03:00:14,125 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 314.0 MB. Free memory is still 279.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:00:14,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.26 ms. Allocated memory is still 314.0 MB. Free memory was 271.0 MB in the beginning and 260.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:00:14,126 INFO L168 Benchmark]: Boogie Preprocessor took 68.71 ms. Allocated memory is still 314.0 MB. Free memory was 260.9 MB in the beginning and 258.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:00:14,126 INFO L168 Benchmark]: RCFGBuilder took 437.57 ms. Allocated memory is still 314.0 MB. Free memory was 258.9 MB in the beginning and 241.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:00:14,126 INFO L168 Benchmark]: TraceAbstraction took 7093.71 ms. Allocated memory was 314.0 MB in the beginning and 555.7 MB in the end (delta: 241.7 MB). Free memory was 241.9 MB in the beginning and 377.9 MB in the end (delta: -136.0 MB). Peak memory consumption was 105.7 MB. Max. memory is 5.3 GB. [2018-01-25 03:00:14,128 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.24 ms. Allocated memory is still 314.0 MB. Free memory is still 279.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 320.26 ms. Allocated memory is still 314.0 MB. Free memory was 271.0 MB in the beginning and 260.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 68.71 ms. Allocated memory is still 314.0 MB. Free memory was 260.9 MB in the beginning and 258.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 437.57 ms. Allocated memory is still 314.0 MB. Free memory was 258.9 MB in the beginning and 241.9 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7093.71 ms. Allocated memory was 314.0 MB in the beginning and 555.7 MB in the end (delta: 241.7 MB). Free memory was 241.9 MB in the beginning and 377.9 MB in the end (delta: -136.0 MB). Peak memory consumption was 105.7 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, 7.0s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 150 SDslu, 679 SDs, 0 SdLazy, 926 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 3.8s 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.2s SatisfiabilityAnalysisTime, 2.9s 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_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-00-14-138.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_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-00-14-138.csv Received shutdown request...