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_smtcomp.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:54:17,386 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:54:17,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:54:17,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:54:17,400 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:54:17,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:54:17,401 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:54:17,402 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:54:17,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:54:17,405 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:54:17,405 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:54:17,405 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:54:17,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:54:17,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:54:17,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:54:17,410 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:54:17,412 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:54:17,414 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:54:17,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:54:17,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:54:17,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:54:17,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:54:17,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:54:17,421 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:54:17,422 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:54:17,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:54:17,423 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:54:17,424 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:54:17,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:54:17,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:54:17,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:54:17,425 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_smtcomp.epf [2018-01-25 05:54:17,435 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:54:17,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:54:17,436 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:54:17,436 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:54:17,436 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:54:17,437 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:54:17,437 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:54:17,437 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:54:17,438 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:54:17,438 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:54:17,438 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:54:17,438 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:54:17,438 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:54:17,439 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:54:17,439 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:54:17,439 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:54:17,439 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:54:17,439 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:54:17,439 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:54:17,440 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:54:17,440 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:54:17,440 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:54:17,440 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:54:17,440 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:54:17,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:54:17,441 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:54:17,441 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:54:17,441 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:54:17,441 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:54:17,442 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:54:17,442 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:54:17,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:54:17,442 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:54:17,442 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:54:17,443 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:54:17,443 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:54:17,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:54:17,490 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:54:17,494 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:54:17,496 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:54:17,496 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:54:17,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-01-25 05:54:17,685 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:54:17,689 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:54:17,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:54:17,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:54:17,694 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:54:17,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:54:17" (1/1) ... [2018-01-25 05:54:17,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11cccfa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:17, skipping insertion in model container [2018-01-25 05:54:17,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:54:17" (1/1) ... [2018-01-25 05:54:17,715 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:54:17,754 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:54:17,869 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:54:17,885 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:54:17,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:17 WrapperNode [2018-01-25 05:54:17,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:54:17,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:54:17,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:54:17,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:54:17,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:17" (1/1) ... [2018-01-25 05:54:17,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:17" (1/1) ... [2018-01-25 05:54:17,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:17" (1/1) ... [2018-01-25 05:54:17,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:17" (1/1) ... [2018-01-25 05:54:17,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:17" (1/1) ... [2018-01-25 05:54:17,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:17" (1/1) ... [2018-01-25 05:54:17,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:17" (1/1) ... [2018-01-25 05:54:17,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:54:17,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:54:17,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:54:17,927 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:54:17,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:17" (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 05:54:17,975 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:54:17,975 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:54:17,975 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-01-25 05:54:17,975 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-01-25 05:54:17,975 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:54:17,975 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:54:17,976 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:54:17,976 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:54:17,976 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:54:17,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:54:17,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:54:17,976 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:54:17,976 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:54:17,976 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:54:17,976 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-01-25 05:54:17,976 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-01-25 05:54:17,977 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:54:17,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:54:17,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:54:18,252 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:54:18,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:54:18 BoogieIcfgContainer [2018-01-25 05:54:18,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:54:18,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:54:18,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:54:18,255 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:54:18,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:54:17" (1/3) ... [2018-01-25 05:54:18,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b116c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:54:18, skipping insertion in model container [2018-01-25 05:54:18,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:17" (2/3) ... [2018-01-25 05:54:18,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b116c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:54:18, skipping insertion in model container [2018-01-25 05:54:18,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:54:18" (3/3) ... [2018-01-25 05:54:18,258 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-01-25 05:54:18,265 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:54:18,271 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-01-25 05:54:18,316 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:54:18,316 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:54:18,316 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:54:18,317 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:54:18,317 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:54:18,317 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:54:18,317 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:54:18,317 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:54:18,318 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:54:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-01-25 05:54:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:54:18,347 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:18,348 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:18,348 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:18,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130535, now seen corresponding path program 1 times [2018-01-25 05:54:18,356 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:18,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:18,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:18,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:18,413 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:18,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:18,653 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 05:54:18,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:18,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:54:18,655 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:18,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:54:18,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:54:18,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:54:18,670 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 5 states. [2018-01-25 05:54:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:18,952 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-01-25 05:54:18,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:54:18,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-25 05:54:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:18,961 INFO L225 Difference]: With dead ends: 71 [2018-01-25 05:54:18,961 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 05:54:18,963 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:54:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 05:54:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-25 05:54:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 05:54:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-01-25 05:54:18,993 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 10 [2018-01-25 05:54:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:18,994 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-01-25 05:54:18,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:54:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-01-25 05:54:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 05:54:18,994 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:18,994 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:18,994 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:18,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130536, now seen corresponding path program 1 times [2018-01-25 05:54:18,995 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:18,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:18,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:18,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:18,996 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:19,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:19,107 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 05:54:19,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:19,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:54:19,108 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:19,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:54:19,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:54:19,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:54:19,110 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 6 states. [2018-01-25 05:54:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:19,378 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-01-25 05:54:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:54:19,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-01-25 05:54:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:19,380 INFO L225 Difference]: With dead ends: 64 [2018-01-25 05:54:19,381 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 05:54:19,382 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:54:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 05:54:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 05:54:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 05:54:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-01-25 05:54:19,393 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 10 [2018-01-25 05:54:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:19,394 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-01-25 05:54:19,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:54:19,394 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-01-25 05:54:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:54:19,394 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:19,395 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:19,395 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:19,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947157, now seen corresponding path program 1 times [2018-01-25 05:54:19,395 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:19,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:19,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:19,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:19,398 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:19,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:19,551 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 05:54:19,552 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:19,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:54:19,552 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:19,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:54:19,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:54:19,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:54:19,553 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 5 states. [2018-01-25 05:54:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:19,646 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-01-25 05:54:19,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:54:19,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:54:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:19,647 INFO L225 Difference]: With dead ends: 60 [2018-01-25 05:54:19,647 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 05:54:19,648 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 05:54:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 05:54:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-25 05:54:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 05:54:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-01-25 05:54:19,653 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 14 [2018-01-25 05:54:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:19,654 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-01-25 05:54:19,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:54:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-01-25 05:54:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:54:19,654 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:19,655 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:19,655 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:19,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947156, now seen corresponding path program 1 times [2018-01-25 05:54:19,655 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:19,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:19,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:19,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:19,656 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:19,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:19,770 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 05:54:19,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:19,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:54:19,771 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:19,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:54:19,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:54:19,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:54:19,771 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 6 states. [2018-01-25 05:54:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:19,932 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-01-25 05:54:19,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:54:19,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-25 05:54:19,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:19,933 INFO L225 Difference]: With dead ends: 59 [2018-01-25 05:54:19,934 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 05:54:19,934 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:54:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 05:54:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-25 05:54:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 05:54:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-01-25 05:54:19,938 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 14 [2018-01-25 05:54:19,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:19,938 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-01-25 05:54:19,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:54:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-01-25 05:54:19,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:54:19,939 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:19,939 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 05:54:19,939 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:19,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006569, now seen corresponding path program 1 times [2018-01-25 05:54:19,939 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:19,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:19,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:19,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:19,940 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:19,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:20,101 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 05:54:20,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:20,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 05:54:20,102 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:20,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:54:20,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:54:20,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:54:20,103 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 12 states. [2018-01-25 05:54:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:20,408 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-01-25 05:54:20,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:54:20,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-01-25 05:54:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:20,409 INFO L225 Difference]: With dead ends: 58 [2018-01-25 05:54:20,410 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 05:54:20,410 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:54:20,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 05:54:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 05:54:20,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 05:54:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-01-25 05:54:20,415 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 17 [2018-01-25 05:54:20,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:20,415 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-01-25 05:54:20,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:54:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-01-25 05:54:20,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 05:54:20,416 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:20,416 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 05:54:20,416 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:20,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006570, now seen corresponding path program 1 times [2018-01-25 05:54:20,416 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:20,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:20,417 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:20,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:20,417 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:20,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:20,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:20,579 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 05:54:20,579 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:20,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:54:20,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:54:20,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:54:20,581 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 12 states. [2018-01-25 05:54:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:20,903 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-01-25 05:54:20,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:54:20,904 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-01-25 05:54:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:20,905 INFO L225 Difference]: With dead ends: 57 [2018-01-25 05:54:20,905 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 05:54:20,905 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:54:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 05:54:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-25 05:54:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 05:54:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-01-25 05:54:20,910 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 17 [2018-01-25 05:54:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:20,910 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-01-25 05:54:20,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:54:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-01-25 05:54:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:54:20,911 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:20,911 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] [2018-01-25 05:54:20,911 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:20,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658956, now seen corresponding path program 1 times [2018-01-25 05:54:20,911 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:20,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:20,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:20,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:20,912 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:20,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:20,984 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 05:54:20,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:20,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:54:20,984 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:20,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:54:20,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:54:20,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:54:20,985 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 8 states. [2018-01-25 05:54:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:21,088 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-01-25 05:54:21,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:54:21,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-25 05:54:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:21,112 INFO L225 Difference]: With dead ends: 65 [2018-01-25 05:54:21,112 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 05:54:21,112 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:54:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 05:54:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-01-25 05:54:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:54:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-01-25 05:54:21,117 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 23 [2018-01-25 05:54:21,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:21,117 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-01-25 05:54:21,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:54:21,118 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-01-25 05:54:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 05:54:21,118 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:21,118 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] [2018-01-25 05:54:21,119 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:21,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658957, now seen corresponding path program 1 times [2018-01-25 05:54:21,119 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:21,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:21,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:21,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:21,120 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:21,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:21,246 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 05:54:21,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:21,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:54:21,246 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:21,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:54:21,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:54:21,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:54:21,247 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 9 states. [2018-01-25 05:54:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:21,337 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-25 05:54:21,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:54:21,337 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-25 05:54:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:21,338 INFO L225 Difference]: With dead ends: 54 [2018-01-25 05:54:21,338 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 05:54:21,338 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:54:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 05:54:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 05:54:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 05:54:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-01-25 05:54:21,344 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 23 [2018-01-25 05:54:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:21,344 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-01-25 05:54:21,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:54:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-01-25 05:54:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:54:21,345 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:21,345 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:21,345 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:21,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479601, now seen corresponding path program 1 times [2018-01-25 05:54:21,346 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:21,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:21,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:21,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:21,347 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:21,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:21,874 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 05:54:21,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:21,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-25 05:54:21,874 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:21,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:54:21,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:54:21,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-01-25 05:54:21,875 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-01-25 05:54:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:22,547 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-01-25 05:54:22,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 05:54:22,548 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-01-25 05:54:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:22,551 INFO L225 Difference]: With dead ends: 53 [2018-01-25 05:54:22,551 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:54:22,552 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2018-01-25 05:54:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:54:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-01-25 05:54:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:54:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-01-25 05:54:22,558 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2018-01-25 05:54:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:22,559 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-01-25 05:54:22,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 05:54:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-01-25 05:54:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:54:22,560 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:22,560 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:22,560 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:22,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479602, now seen corresponding path program 1 times [2018-01-25 05:54:22,560 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:22,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:22,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:22,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:22,562 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:22,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:22,867 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 05:54:22,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:22,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-25 05:54:22,868 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:22,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:54:22,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:54:22,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-01-25 05:54:22,869 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 18 states. [2018-01-25 05:54:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:23,348 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-01-25 05:54:23,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 05:54:23,348 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-01-25 05:54:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:23,349 INFO L225 Difference]: With dead ends: 51 [2018-01-25 05:54:23,349 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:54:23,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-01-25 05:54:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:54:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-25 05:54:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 05:54:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-01-25 05:54:23,353 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2018-01-25 05:54:23,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:23,354 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-01-25 05:54:23,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 05:54:23,354 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-01-25 05:54:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:54:23,355 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:23,355 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] [2018-01-25 05:54:23,355 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674501, now seen corresponding path program 1 times [2018-01-25 05:54:23,355 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:23,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:23,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:23,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:23,356 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:23,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:23,835 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 05:54:23,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:23,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-25 05:54:23,836 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:23,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:54:23,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:54:23,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-25 05:54:23,837 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 18 states. [2018-01-25 05:54:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:24,646 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-01-25 05:54:24,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 05:54:24,647 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-01-25 05:54:24,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:24,647 INFO L225 Difference]: With dead ends: 49 [2018-01-25 05:54:24,648 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:54:24,648 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2018-01-25 05:54:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:54:24,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-01-25 05:54:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 05:54:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-01-25 05:54:24,654 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 28 [2018-01-25 05:54:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:24,654 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-01-25 05:54:24,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 05:54:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-01-25 05:54:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:54:24,655 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:24,656 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] [2018-01-25 05:54:24,656 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:24,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674502, now seen corresponding path program 1 times [2018-01-25 05:54:24,656 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:24,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:24,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:24,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:24,657 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:24,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:25,107 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 05:54:25,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:25,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-25 05:54:25,108 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:25,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:54:25,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:54:25,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-25 05:54:25,109 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 18 states. [2018-01-25 05:54:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:25,798 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-01-25 05:54:25,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 05:54:25,799 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-01-25 05:54:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:25,799 INFO L225 Difference]: With dead ends: 48 [2018-01-25 05:54:25,799 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 05:54:25,800 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 05:54:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 05:54:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-25 05:54:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 05:54:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-01-25 05:54:25,804 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 28 [2018-01-25 05:54:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:25,805 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-01-25 05:54:25,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 05:54:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-01-25 05:54:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:54:25,806 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:25,806 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] [2018-01-25 05:54:25,806 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:25,806 INFO L82 PathProgramCache]: Analyzing trace with hash -38443497, now seen corresponding path program 1 times [2018-01-25 05:54:25,806 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:25,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:25,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:25,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:25,808 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:25,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:26,544 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 05:54:26,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:26,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-25 05:54:26,744 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:26,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 05:54:26,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 05:54:26,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-01-25 05:54:26,745 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-01-25 05:54:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:27,472 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-01-25 05:54:27,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 05:54:27,473 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-01-25 05:54:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:27,474 INFO L225 Difference]: With dead ends: 46 [2018-01-25 05:54:27,474 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 05:54:27,474 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 05:54:27,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 05:54:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-01-25 05:54:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 05:54:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-01-25 05:54:27,477 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-01-25 05:54:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:27,478 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-01-25 05:54:27,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 05:54:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-01-25 05:54:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:54:27,479 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:27,479 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] [2018-01-25 05:54:27,479 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:27,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1191748404, now seen corresponding path program 1 times [2018-01-25 05:54:27,480 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:27,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:27,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:27,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:27,481 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:27,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:28,016 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 05:54:28,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:28,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-25 05:54:28,017 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:28,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 05:54:28,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 05:54:28,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-01-25 05:54:28,018 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2018-01-25 05:54:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:28,721 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-01-25 05:54:28,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 05:54:28,721 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-01-25 05:54:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:28,722 INFO L225 Difference]: With dead ends: 45 [2018-01-25 05:54:28,722 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 05:54:28,723 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=1289, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 05:54:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 05:54:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-01-25 05:54:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 05:54:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-01-25 05:54:28,726 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 32 [2018-01-25 05:54:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:28,726 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-01-25 05:54:28,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 05:54:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-01-25 05:54:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 05:54:28,727 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:28,727 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, 1, 1] [2018-01-25 05:54:28,727 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 05:54:28,727 INFO L82 PathProgramCache]: Analyzing trace with hash -718496508, now seen corresponding path program 1 times [2018-01-25 05:54:28,727 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:28,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:28,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:28,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:28,728 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 05:54:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 05:54:28,796 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 05:54:28,815 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-25 05:54:28,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:54:28 BoogieIcfgContainer [2018-01-25 05:54:28,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:54:28,833 INFO L168 Benchmark]: Toolchain (without parser) took 11148.38 ms. Allocated memory was 308.8 MB in the beginning and 602.9 MB in the end (delta: 294.1 MB). Free memory was 268.9 MB in the beginning and 350.8 MB in the end (delta: -81.9 MB). Peak memory consumption was 212.2 MB. Max. memory is 5.3 GB. [2018-01-25 05:54:28,835 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:54:28,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.62 ms. Allocated memory is still 308.8 MB. Free memory was 267.9 MB in the beginning and 257.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:54:28,835 INFO L168 Benchmark]: Boogie Preprocessor took 34.97 ms. Allocated memory is still 308.8 MB. Free memory was 257.8 MB in the beginning and 255.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:54:28,835 INFO L168 Benchmark]: RCFGBuilder took 325.88 ms. Allocated memory is still 308.8 MB. Free memory was 255.8 MB in the beginning and 234.3 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:54:28,836 INFO L168 Benchmark]: TraceAbstraction took 10579.62 ms. Allocated memory was 308.8 MB in the beginning and 602.9 MB in the end (delta: 294.1 MB). Free memory was 233.3 MB in the beginning and 350.8 MB in the end (delta: -117.5 MB). Peak memory consumption was 176.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:54:28,838 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.19 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.62 ms. Allocated memory is still 308.8 MB. Free memory was 267.9 MB in the beginning and 257.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.97 ms. Allocated memory is still 308.8 MB. Free memory was 257.8 MB in the beginning and 255.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 325.88 ms. Allocated memory is still 308.8 MB. Free memory was 255.8 MB in the beginning and 234.3 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10579.62 ms. Allocated memory was 308.8 MB in the beginning and 602.9 MB in the end (delta: 294.1 MB). Free memory was 233.3 MB in the beginning and 350.8 MB in the end (delta: -117.5 MB). Peak memory consumption was 176.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] FCALL TData data; VAL [data={17:0}] [L643] CALL alloc_data(&data) VAL [pdata={17:0}] [L625] EXPR, FCALL malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L625] FCALL pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L626] EXPR, FCALL malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}] [L626] FCALL pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}] [L627] EXPR, FCALL pdata->lo VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}, pdata->lo={12:0}] [L627] FCALL *(pdata->lo) = 4 VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->lo={12:0}] [L628] EXPR, FCALL pdata->hi VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}, pdata->hi={14:0}] [L628] RET, FCALL *(pdata->hi) = 8 VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->hi={14:0}] [L643] alloc_data(&data) VAL [data={17:0}] [L644] CALL free_data(&data) VAL [data={17:0}] [L632] EXPR, FCALL data->lo VAL [data={17:0}, data={17:0}, data->lo={12:0}] [L632] int *lo = data->lo; [L633] EXPR, FCALL data->hi VAL [data={17:0}, data={17:0}, data->hi={14:0}, lo={12:0}] [L633] int *hi = data->hi; [L634] EXPR, FCALL \read(*lo) VAL [\read(*lo)=4, data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L634] EXPR, FCALL \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L634] COND FALSE !(*lo >= *hi) [L638] FCALL data->lo = ((void *)0) VAL [data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L639] RET, FCALL data->hi = ((void *)0) VAL [data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L644] free_data(&data) VAL [data={17:0}] [L645] return 0; VAL [\result=0, data={17:0}] [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 71 locations, 29 error locations. UNSAFE Result, 10.5s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 462 SDtfs, 590 SDslu, 2203 SDs, 0 SdLazy, 3625 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred 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, 14 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 100406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-54-28-845.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-54-28-845.csv Received shutdown request...