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/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:19:19,045 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:19:19,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:19:19,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:19:19,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:19:19,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:19:19,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:19:19,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:19:19,073 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:19:19,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:19:19,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:19:19,078 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:19:19,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:19:19,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:19:19,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:19:19,088 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:19:19,091 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:19:19,093 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:19:19,096 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:19:19,098 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:19:19,103 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:19:19,104 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:19:19,104 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:19:19,105 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:19:19,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:19:19,118 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:19:19,119 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:19:19,119 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:19:19,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:19:19,120 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:19:19,126 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:19:19,126 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:19:19,146 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:19:19,146 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:19:19,147 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:19:19,147 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:19:19,148 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:19:19,148 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:19:19,148 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:19:19,148 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:19:19,148 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:19:19,149 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:19:19,150 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:19:19,150 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:19:19,150 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:19:19,150 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:19:19,150 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:19:19,151 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:19:19,151 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:19:19,151 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:19:19,151 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:19:19,151 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:19:19,152 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:19:19,152 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:19:19,153 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:19:19,153 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:19:19,153 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:19:19,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:19:19,154 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:19:19,154 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:19:19,154 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:19:19,154 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:19:19,155 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:19:19,155 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:19:19,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:19:19,156 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:19:19,156 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:19:19,157 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:19:19,157 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:19:19,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:19:19,254 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:19:19,258 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:19:19,261 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:19:19,261 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:19:19,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i [2018-01-25 03:19:19,517 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:19:19,528 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:19:19,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:19:19,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:19:19,539 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:19:19,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:19:19" (1/1) ... [2018-01-25 03:19:19,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9535cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:19, skipping insertion in model container [2018-01-25 03:19:19,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:19:19" (1/1) ... [2018-01-25 03:19:19,580 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:19:19,677 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:19:19,865 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:19:19,900 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:19:19,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:19 WrapperNode [2018-01-25 03:19:19,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:19:19,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:19:19,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:19:19,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:19:19,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:19" (1/1) ... [2018-01-25 03:19:19,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:19" (1/1) ... [2018-01-25 03:19:19,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:19" (1/1) ... [2018-01-25 03:19:19,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:19" (1/1) ... [2018-01-25 03:19:19,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:19" (1/1) ... [2018-01-25 03:19:20,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:19" (1/1) ... [2018-01-25 03:19:20,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:19" (1/1) ... [2018-01-25 03:19:20,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:19:20,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:19:20,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:19:20,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:19:20,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:19" (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:19:20,083 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:19:20,083 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:19:20,084 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-01-25 03:19:20,084 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-01-25 03:19:20,084 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:19:20,084 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:19:20,084 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:19:20,084 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:19:20,085 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:19:20,085 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:19:20,085 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:19:20,085 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:19:20,085 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:19:20,085 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:19:20,086 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-01-25 03:19:20,086 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-01-25 03:19:20,086 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:19:20,086 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:19:20,086 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:19:20,503 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:19:20,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:19:20 BoogieIcfgContainer [2018-01-25 03:19:20,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:19:20,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:19:20,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:19:20,507 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:19:20,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:19:19" (1/3) ... [2018-01-25 03:19:20,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6c8231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:19:20, skipping insertion in model container [2018-01-25 03:19:20,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:19" (2/3) ... [2018-01-25 03:19:20,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6c8231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:19:20, skipping insertion in model container [2018-01-25 03:19:20,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:19:20" (3/3) ... [2018-01-25 03:19:20,511 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0019_1_true-valid-memsafety_true-termination.i [2018-01-25 03:19:20,518 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:19:20,524 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-01-25 03:19:20,570 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:19:20,570 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:19:20,570 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:19:20,571 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:19:20,571 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:19:20,571 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:19:20,571 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:19:20,571 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:19:20,572 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:19:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-25 03:19:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 03:19:20,597 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:20,598 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:20,598 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2011258117, now seen corresponding path program 1 times [2018-01-25 03:19:20,604 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:20,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:20,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:20,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:20,648 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:20,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:21,041 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:19:21,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:21,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:19:21,045 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:21,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:19:21,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:19:21,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:19:21,069 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 5 states. [2018-01-25 03:19:21,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:21,577 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-01-25 03:19:21,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:19:21,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-25 03:19:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:21,592 INFO L225 Difference]: With dead ends: 63 [2018-01-25 03:19:21,592 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 03:19:21,596 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:19:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 03:19:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 03:19:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 03:19:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-01-25 03:19:21,639 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 10 [2018-01-25 03:19:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:21,639 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-01-25 03:19:21,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:19:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-01-25 03:19:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 03:19:21,640 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:21,641 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:21,641 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:21,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2011258116, now seen corresponding path program 1 times [2018-01-25 03:19:21,642 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:21,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:21,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:21,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:21,644 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:21,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:21,886 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:19:21,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:21,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:19:21,887 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:21,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:19:21,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:19:21,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:19:21,890 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 6 states. [2018-01-25 03:19:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:22,266 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-01-25 03:19:22,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:19:22,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-01-25 03:19:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:22,268 INFO L225 Difference]: With dead ends: 54 [2018-01-25 03:19:22,268 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 03:19:22,269 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:19:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 03:19:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 03:19:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 03:19:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-01-25 03:19:22,275 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 10 [2018-01-25 03:19:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:22,275 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-01-25 03:19:22,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:19:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-01-25 03:19:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:19:22,276 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:22,276 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:22,276 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:22,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1103295359, now seen corresponding path program 1 times [2018-01-25 03:19:22,277 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:22,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:22,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:22,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:22,278 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:22,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:22,434 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:19:22,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:22,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:19:22,435 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:22,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:19:22,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:19:22,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:19:22,436 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 5 states. [2018-01-25 03:19:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:22,717 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-01-25 03:19:22,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:19:22,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 03:19:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:22,718 INFO L225 Difference]: With dead ends: 48 [2018-01-25 03:19:22,718 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 03:19:22,719 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:19:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 03:19:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 03:19:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 03:19:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-01-25 03:19:22,724 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 14 [2018-01-25 03:19:22,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:22,724 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-01-25 03:19:22,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:19:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-01-25 03:19:22,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:19:22,725 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:22,725 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:22,725 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:22,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1103295360, now seen corresponding path program 1 times [2018-01-25 03:19:22,725 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:22,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:22,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:22,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:22,727 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:22,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:22,893 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:19:22,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:22,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:19:22,894 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:22,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:19:22,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:19:22,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:19:22,896 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 6 states. [2018-01-25 03:19:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:23,117 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-01-25 03:19:23,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:19:23,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-25 03:19:23,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:23,120 INFO L225 Difference]: With dead ends: 47 [2018-01-25 03:19:23,120 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 03:19:23,121 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:19:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 03:19:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 03:19:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 03:19:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-01-25 03:19:23,132 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 14 [2018-01-25 03:19:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:23,132 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-01-25 03:19:23,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:19:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-01-25 03:19:23,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:19:23,133 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:23,133 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:23,133 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:23,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1112691179, now seen corresponding path program 1 times [2018-01-25 03:19:23,134 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:23,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:23,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:23,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:23,135 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:23,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:23,572 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:19:23,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:23,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 03:19:23,573 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:23,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 03:19:23,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 03:19:23,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:19:23,576 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 12 states. [2018-01-25 03:19:24,080 WARN L146 SmtUtils]: Spent 313ms on a formula simplification. DAG size of input: 33 DAG size of output 29 [2018-01-25 03:19:24,555 WARN L146 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 33 DAG size of output 29 [2018-01-25 03:19:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:24,750 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-01-25 03:19:24,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:19:24,751 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-01-25 03:19:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:24,753 INFO L225 Difference]: With dead ends: 46 [2018-01-25 03:19:24,753 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 03:19:24,753 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:19:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 03:19:24,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-25 03:19:24,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 03:19:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-01-25 03:19:24,759 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 17 [2018-01-25 03:19:24,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:24,759 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-01-25 03:19:24,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 03:19:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-01-25 03:19:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:19:24,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:24,761 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:24,761 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:24,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1112691178, now seen corresponding path program 1 times [2018-01-25 03:19:24,761 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:24,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:24,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:24,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:24,763 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:24,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:25,120 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:19:25,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:25,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 03:19:25,121 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:25,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 03:19:25,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 03:19:25,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:19:25,122 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 12 states. [2018-01-25 03:19:25,947 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 41 DAG size of output 37 [2018-01-25 03:19:26,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:26,345 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-01-25 03:19:26,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:19:26,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-01-25 03:19:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:26,347 INFO L225 Difference]: With dead ends: 45 [2018-01-25 03:19:26,348 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 03:19:26,348 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:19:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 03:19:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-25 03:19:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 03:19:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-01-25 03:19:26,365 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 17 [2018-01-25 03:19:26,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:26,366 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-01-25 03:19:26,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 03:19:26,366 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-01-25 03:19:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 03:19:26,367 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:26,367 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:19:26,367 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:26,368 INFO L82 PathProgramCache]: Analyzing trace with hash -221609387, now seen corresponding path program 1 times [2018-01-25 03:19:26,368 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:26,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:26,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:26,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:26,369 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:26,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:27,305 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:19:27,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:27,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 03:19:27,306 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:27,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 03:19:27,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 03:19:27,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:19:27,307 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 17 states. [2018-01-25 03:19:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:27,885 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-01-25 03:19:27,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 03:19:27,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-01-25 03:19:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:27,886 INFO L225 Difference]: With dead ends: 48 [2018-01-25 03:19:27,887 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 03:19:27,887 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-01-25 03:19:27,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 03:19:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-01-25 03:19:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 03:19:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-01-25 03:19:27,891 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 25 [2018-01-25 03:19:27,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:27,891 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-01-25 03:19:27,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 03:19:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-01-25 03:19:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 03:19:27,892 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:27,892 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:19:27,892 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:27,892 INFO L82 PathProgramCache]: Analyzing trace with hash -221609386, now seen corresponding path program 1 times [2018-01-25 03:19:27,892 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:27,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:27,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:27,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:27,893 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:27,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:28,291 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:19:28,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:28,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 03:19:28,291 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:28,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 03:19:28,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 03:19:28,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:19:28,292 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 17 states. [2018-01-25 03:19:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:28,888 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-01-25 03:19:28,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 03:19:28,889 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-01-25 03:19:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:28,889 INFO L225 Difference]: With dead ends: 46 [2018-01-25 03:19:28,889 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 03:19:28,890 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2018-01-25 03:19:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 03:19:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-01-25 03:19:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 03:19:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-01-25 03:19:28,894 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 25 [2018-01-25 03:19:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:28,894 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-01-25 03:19:28,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 03:19:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-01-25 03:19:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:19:28,895 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:28,895 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:28,895 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:28,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1720043612, now seen corresponding path program 1 times [2018-01-25 03:19:28,895 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:28,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:28,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:28,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:28,896 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:28,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:29,322 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:19:29,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:29,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 03:19:29,439 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:29,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 03:19:29,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 03:19:29,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:19:29,440 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 17 states. [2018-01-25 03:19:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:30,328 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-01-25 03:19:30,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 03:19:30,329 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-01-25 03:19:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:30,329 INFO L225 Difference]: With dead ends: 44 [2018-01-25 03:19:30,329 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 03:19:30,330 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-01-25 03:19:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 03:19:30,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-01-25 03:19:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-25 03:19:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-01-25 03:19:30,334 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 26 [2018-01-25 03:19:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:30,335 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-01-25 03:19:30,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 03:19:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-01-25 03:19:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:19:30,336 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:30,336 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:30,336 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:30,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1720043613, now seen corresponding path program 1 times [2018-01-25 03:19:30,336 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:30,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:30,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:30,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:30,338 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:30,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:30,839 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:19:30,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:30,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-25 03:19:30,840 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:30,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-25 03:19:30,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-25 03:19:30,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-01-25 03:19:30,841 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-01-25 03:19:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:31,598 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-01-25 03:19:31,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-25 03:19:31,599 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-01-25 03:19:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:31,600 INFO L225 Difference]: With dead ends: 43 [2018-01-25 03:19:31,600 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 03:19:31,601 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2018-01-25 03:19:31,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 03:19:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-01-25 03:19:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 03:19:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-01-25 03:19:31,607 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 26 [2018-01-25 03:19:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:31,607 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-01-25 03:19:31,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-25 03:19:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-01-25 03:19:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 03:19:31,609 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:31,609 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, 1, 1] [2018-01-25 03:19:31,609 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:31,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1435540609, now seen corresponding path program 1 times [2018-01-25 03:19:31,609 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:31,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:31,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:31,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:31,611 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:31,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:32,350 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:19:32,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:32,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-01-25 03:19:32,350 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:32,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 03:19:32,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 03:19:32,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:19:32,351 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-01-25 03:19:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:33,552 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-01-25 03:19:33,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 03:19:33,552 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-01-25 03:19:33,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:33,553 INFO L225 Difference]: With dead ends: 41 [2018-01-25 03:19:33,553 INFO L226 Difference]: Without dead ends: 40 [2018-01-25 03:19:33,554 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2018-01-25 03:19:33,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-25 03:19:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-01-25 03:19:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 03:19:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-01-25 03:19:33,559 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2018-01-25 03:19:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:33,559 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-01-25 03:19:33,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 03:19:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-01-25 03:19:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 03:19:33,560 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:33,561 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, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:33,561 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash 716201536, now seen corresponding path program 1 times [2018-01-25 03:19:33,561 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:33,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:33,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:33,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:33,562 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:33,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:34,351 WARN L146 SmtUtils]: Spent 392ms on a formula simplification. DAG size of input: 19 DAG size of output 10 [2018-01-25 03:19:34,609 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 24 DAG size of output 19 [2018-01-25 03:19:35,301 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:19:35,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:35,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-01-25 03:19:35,302 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:35,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 03:19:35,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 03:19:35,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:19:35,303 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 20 states. [2018-01-25 03:19:36,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:36,435 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2018-01-25 03:19:36,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-25 03:19:36,435 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-01-25 03:19:36,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:36,436 INFO L225 Difference]: With dead ends: 43 [2018-01-25 03:19:36,436 INFO L226 Difference]: Without dead ends: 36 [2018-01-25 03:19:36,437 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2018-01-25 03:19:36,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-25 03:19:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-25 03:19:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-25 03:19:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 35 transitions. [2018-01-25 03:19:36,442 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 35 transitions. Word has length 33 [2018-01-25 03:19:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:36,442 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 35 transitions. [2018-01-25 03:19:36,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 03:19:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 35 transitions. [2018-01-25 03:19:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 03:19:36,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:36,444 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:36,444 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:19:36,444 INFO L82 PathProgramCache]: Analyzing trace with hash 578567044, now seen corresponding path program 1 times [2018-01-25 03:19:36,444 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:36,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:36,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:36,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:36,445 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:36,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:37,651 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:19:37,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:37,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-01-25 03:19:37,652 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:37,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 03:19:37,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 03:19:37,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-01-25 03:19:37,653 INFO L87 Difference]: Start difference. First operand 36 states and 35 transitions. Second operand 21 states. [2018-01-25 03:19:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:38,863 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2018-01-25 03:19:38,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 03:19:38,863 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2018-01-25 03:19:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:38,864 INFO L225 Difference]: With dead ends: 36 [2018-01-25 03:19:38,864 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 03:19:38,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2018-01-25 03:19:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 03:19:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 03:19:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 03:19:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 03:19:38,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-25 03:19:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:38,866 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 03:19:38,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 03:19:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 03:19:38,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 03:19:38,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 03:19:39,491 WARN L146 SmtUtils]: Spent 583ms on a formula simplification. DAG size of input: 87 DAG size of output 63 [2018-01-25 03:19:39,569 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,569 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 644) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:19:39,569 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,570 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 644) the Hoare annotation is: true [2018-01-25 03:19:39,570 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,570 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 644) the Hoare annotation is: true [2018-01-25 03:19:39,570 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,570 INFO L401 ceAbstractionStarter]: For program point alloc_dataEXIT(lines 623 629) no Hoare annotation was computed. [2018-01-25 03:19:39,570 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr8RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,570 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr9RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,570 INFO L401 ceAbstractionStarter]: For program point L627(line 627) no Hoare annotation was computed. [2018-01-25 03:19:39,570 INFO L401 ceAbstractionStarter]: For program point L625''(line 625) no Hoare annotation was computed. [2018-01-25 03:19:39,571 INFO L401 ceAbstractionStarter]: For program point L626(line 626) no Hoare annotation was computed. [2018-01-25 03:19:39,571 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr10RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,571 INFO L401 ceAbstractionStarter]: For program point L625(line 625) no Hoare annotation was computed. [2018-01-25 03:19:39,571 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr3RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,571 INFO L401 ceAbstractionStarter]: For program point L627'(line 627) no Hoare annotation was computed. [2018-01-25 03:19:39,571 INFO L401 ceAbstractionStarter]: For program point L628''(line 628) no Hoare annotation was computed. [2018-01-25 03:19:39,571 INFO L401 ceAbstractionStarter]: For program point L625'(line 625) no Hoare annotation was computed. [2018-01-25 03:19:39,571 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-25 03:19:39,571 INFO L397 ceAbstractionStarter]: At program point alloc_dataENTRY(lines 623 629) 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:19:39,572 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr4RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr0RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr1RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr6RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr5RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point L626'(line 626) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr7RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point alloc_dataFINAL(lines 623 629) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr11RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point alloc_dataErr2RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point L628'(line 628) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-25 03:19:39,572 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,573 INFO L397 ceAbstractionStarter]: At program point L640(line 640) 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:19:39,573 INFO L401 ceAbstractionStarter]: For program point L640''(line 640) no Hoare annotation was computed. [2018-01-25 03:19:39,573 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 639 644) no Hoare annotation was computed. [2018-01-25 03:19:39,573 INFO L401 ceAbstractionStarter]: For program point L642''(line 642) no Hoare annotation was computed. [2018-01-25 03:19:39,573 INFO L401 ceAbstractionStarter]: For program point L640'(line 640) no Hoare annotation was computed. [2018-01-25 03:19:39,573 INFO L401 ceAbstractionStarter]: For program point L642(line 642) no Hoare annotation was computed. [2018-01-25 03:19:39,573 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 639 644) no Hoare annotation was computed. [2018-01-25 03:19:39,573 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,573 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 639 644) no Hoare annotation was computed. [2018-01-25 03:19:39,573 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 639 644) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:19:39,573 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,574 INFO L397 ceAbstractionStarter]: At program point L642'(line 642) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$.base| |main_~#data~5.base|)) (.cse1 (+ |main_~#data~5.offset| 4))) (let ((.cse3 (store |#valid| |main_~#data~5.base| 0)) (.cse2 (select .cse5 .cse1)) (.cse4 (select .cse5 |main_~#data~5.offset|)) (.cse0 (select |#memory_$Pointer$.offset| |main_~#data~5.base|))) (and (= 0 |main_#t~mem11.offset|) (= 0 (select .cse0 .cse1)) (= 1 (select |#valid| .cse2)) (= (store (store .cse3 |main_#t~mem11.base| 0) |main_#t~mem10.base| 0) |old(#valid)|) (= 8 (select (select |#memory_int| |main_#t~mem11.base|) 0)) (= (store (store .cse3 .cse2 0) |main_#t~mem10.base| 0) |old(#valid)|) (not (= 0 |main_#t~mem10.base|)) (not (= .cse4 .cse2)) (= 1 (select |#valid| |main_~#data~5.base|)) (= 4 (select (select |#memory_int| |main_#t~mem10.base|) |main_#t~mem10.offset|)) (= 0 |main_#t~mem10.offset|) (= |main_#t~mem10.base| .cse4) (not (= 0 .cse2)) (not (= |main_~#data~5.base| |main_#t~mem10.base|)) (= 4 (select |#length| .cse2)) (= 8 (select |#length| |main_~#data~5.base|)) (= 1 (select |#valid| |main_#t~mem10.base|)) (<= 4 (select |#length| .cse4)) (= 0 (select .cse0 |main_~#data~5.offset|)) (= 0 |main_~#data~5.offset|)))) [2018-01-25 03:19:39,574 INFO L401 ceAbstractionStarter]: For program point free_dataErr1RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,574 INFO L401 ceAbstractionStarter]: For program point free_dataErr6RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,574 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-25 03:19:39,574 INFO L401 ceAbstractionStarter]: For program point L634''(line 634) no Hoare annotation was computed. [2018-01-25 03:19:39,574 INFO L401 ceAbstractionStarter]: For program point free_dataErr2RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,574 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-25 03:19:39,574 INFO L401 ceAbstractionStarter]: For program point free_dataErr4RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,574 INFO L401 ceAbstractionStarter]: For program point free_dataErr7RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,574 INFO L401 ceAbstractionStarter]: For program point L636'(line 636) no Hoare annotation was computed. [2018-01-25 03:19:39,574 INFO L401 ceAbstractionStarter]: For program point free_dataErr0RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,574 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-25 03:19:39,575 INFO L397 ceAbstractionStarter]: At program point free_dataENTRY(lines 630 638) the Hoare annotation is: (or (= |#valid| |old(#valid)|) (not (= (select |old(#valid)| |free_data_#in~data.hi.base|) 1)) (< (select |#length| |free_data_#in~data.lo.base|) 4) (not (= 0 |free_data_#in~data.hi.offset|)) (= |free_data_#in~data.lo.base| |free_data_#in~data.hi.base|) (not (= 0 |free_data_#in~data.lo.offset|)) (not (= 1 (select |old(#valid)| |free_data_#in~data.lo.base|))) (not (= (select |#length| |free_data_#in~data.hi.base|) 4))) [2018-01-25 03:19:39,575 INFO L401 ceAbstractionStarter]: For program point free_dataFINAL(lines 630 638) no Hoare annotation was computed. [2018-01-25 03:19:39,575 INFO L401 ceAbstractionStarter]: For program point free_dataErr5RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,575 INFO L401 ceAbstractionStarter]: For program point free_dataErr3RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-25 03:19:39,575 INFO L401 ceAbstractionStarter]: For program point free_dataEXIT(lines 630 638) no Hoare annotation was computed. [2018-01-25 03:19:39,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:19:39 BoogieIcfgContainer [2018-01-25 03:19:39,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:19:39,579 INFO L168 Benchmark]: Toolchain (without parser) took 20061.67 ms. Allocated memory was 305.7 MB in the beginning and 632.8 MB in the end (delta: 327.2 MB). Free memory was 264.6 MB in the beginning and 385.4 MB in the end (delta: -120.8 MB). Peak memory consumption was 206.4 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:39,580 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:19:39,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.33 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.6 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:19:39,581 INFO L168 Benchmark]: Boogie Preprocessor took 87.13 ms. Allocated memory is still 305.7 MB. Free memory was 254.6 MB in the beginning and 252.6 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:19:39,581 INFO L168 Benchmark]: RCFGBuilder took 489.66 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 231.7 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:39,581 INFO L168 Benchmark]: TraceAbstraction took 19073.38 ms. Allocated memory was 305.7 MB in the beginning and 632.8 MB in the end (delta: 327.2 MB). Free memory was 231.7 MB in the beginning and 385.4 MB in the end (delta: -153.7 MB). Peak memory consumption was 173.5 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:39,583 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 305.7 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 397.33 ms. Allocated memory is still 305.7 MB. Free memory was 264.6 MB in the beginning and 254.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 87.13 ms. Allocated memory is still 305.7 MB. Free memory was 254.6 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 489.66 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 231.7 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 19073.38 ms. Allocated memory was 305.7 MB in the beginning and 632.8 MB in the end (delta: 327.2 MB). Free memory was 231.7 MB in the beginning and 385.4 MB in the end (delta: -153.7 MB). Peak memory consumption was 173.5 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: 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: 639]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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]: free always succeeds For all program executions holds that free 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]: 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]: pointer dereference always succeeds For all program executions holds that pointer dereference 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 25 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 63 locations, 25 error locations. SAFE Result, 19.0s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 425 SDslu, 1733 SDs, 0 SdLazy, 3121 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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, 13 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 8 NumberOfFragments, 248 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 130 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 132797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-19-39-594.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-19-39-594.csv Received shutdown request...