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_imprecise.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-24 17:09:57,807 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:09:57,809 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:09:57,824 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:09:57,825 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:09:57,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:09:57,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:09:57,829 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:09:57,830 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:09:57,831 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:09:57,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:09:57,832 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:09:57,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:09:57,834 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:09:57,835 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:09:57,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:09:57,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:09:57,841 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:09:57,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:09:57,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:09:57,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:09:57,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:09:57,847 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:09:57,848 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:09:57,849 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:09:57,850 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:09:57,851 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:09:57,851 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:09:57,852 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:09:57,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:09:57,853 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:09:57,853 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:09:57,863 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:09:57,864 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:09:57,865 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:09:57,865 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:09:57,865 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:09:57,865 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:09:57,865 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:09:57,866 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:09:57,866 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:09:57,867 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:09:57,867 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:09:57,867 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:09:57,867 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:09:57,867 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:09:57,868 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:09:57,868 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:09:57,868 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:09:57,868 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:09:57,868 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:09:57,869 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:09:57,869 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:09:57,869 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:09:57,869 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:09:57,869 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:09:57,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:09:57,870 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:09:57,870 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:09:57,870 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:09:57,870 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:09:57,871 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:09:57,871 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:09:57,871 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:09:57,871 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:09:57,871 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:09:57,872 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:09:57,872 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:09:57,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:09:57,922 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:09:57,926 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:09:57,928 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:09:57,929 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:09:57,929 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-24 17:09:58,110 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:09:58,117 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:09:58,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:09:58,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:09:58,126 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:09:58,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:09:58" (1/1) ... [2018-01-24 17:09:58,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69156849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:09:58, skipping insertion in model container [2018-01-24 17:09:58,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:09:58" (1/1) ... [2018-01-24 17:09:58,152 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:09:58,193 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:09:58,311 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:09:58,330 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:09:58,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:09:58 WrapperNode [2018-01-24 17:09:58,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:09:58,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:09:58,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:09:58,340 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:09:58,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:09:58" (1/1) ... [2018-01-24 17:09:58,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:09:58" (1/1) ... [2018-01-24 17:09:58,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:09:58" (1/1) ... [2018-01-24 17:09:58,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:09:58" (1/1) ... [2018-01-24 17:09:58,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:09:58" (1/1) ... [2018-01-24 17:09:58,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:09:58" (1/1) ... [2018-01-24 17:09:58,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:09:58" (1/1) ... [2018-01-24 17:09:58,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:09:58,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:09:58,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:09:58,382 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:09:58,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:09:58" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:09:58,442 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:09:58,442 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:09:58,443 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-01-24 17:09:58,443 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-01-24 17:09:58,443 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:09:58,443 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:09:58,443 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:09:58,443 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 17:09:58,444 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 17:09:58,444 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:09:58,444 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:09:58,444 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:09:58,444 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:09:58,444 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 17:09:58,445 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-01-24 17:09:58,445 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-01-24 17:09:58,445 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:09:58,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:09:58,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:09:58,749 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:09:58,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:09:58 BoogieIcfgContainer [2018-01-24 17:09:58,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:09:58,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:09:58,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:09:58,752 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:09:58,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:09:58" (1/3) ... [2018-01-24 17:09:58,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4eeefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:09:58, skipping insertion in model container [2018-01-24 17:09:58,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:09:58" (2/3) ... [2018-01-24 17:09:58,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4eeefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:09:58, skipping insertion in model container [2018-01-24 17:09:58,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:09:58" (3/3) ... [2018-01-24 17:09:58,757 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-01-24 17:09:58,764 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:09:58,771 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-01-24 17:09:58,810 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:09:58,810 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:09:58,810 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:09:58,810 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:09:58,810 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:09:58,810 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:09:58,811 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:09:58,811 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:09:58,811 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:09:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-01-24 17:09:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 17:09:58,834 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:09:58,835 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:09:58,835 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-24 17:09:58,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130535, now seen corresponding path program 1 times [2018-01-24 17:09:58,841 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:09:58,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:09:58,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:09:58,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:09:58,884 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:09:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:09:58,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:09:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:09:59,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:09:59,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:09:59,111 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:09:59,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:09:59,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:09:59,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:09:59,133 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 5 states. [2018-01-24 17:09:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:09:59,428 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-01-24 17:09:59,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:09:59,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 17:09:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:09:59,439 INFO L225 Difference]: With dead ends: 71 [2018-01-24 17:09:59,440 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 17:09:59,442 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:09:59,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 17:09:59,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-24 17:09:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 17:09:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-01-24 17:09:59,475 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 10 [2018-01-24 17:09:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:09:59,476 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-01-24 17:09:59,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:09:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-01-24 17:09:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 17:09:59,477 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:09:59,477 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:09:59,477 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-24 17:09:59,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130536, now seen corresponding path program 1 times [2018-01-24 17:09:59,477 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:09:59,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:09:59,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:09:59,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:09:59,479 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:09:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:09:59,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:09:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:09:59,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:09:59,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:09:59,637 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:09:59,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:09:59,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:09:59,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:09:59,639 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 6 states. [2018-01-24 17:09:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:09:59,943 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-01-24 17:09:59,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:09:59,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-01-24 17:09:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:09:59,945 INFO L225 Difference]: With dead ends: 64 [2018-01-24 17:09:59,945 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 17:09:59,946 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:09:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 17:09:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 17:09:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 17:09:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-01-24 17:09:59,955 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 10 [2018-01-24 17:09:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:09:59,955 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-01-24 17:09:59,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:09:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-01-24 17:09:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 17:09:59,956 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:09:59,956 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:09:59,956 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-24 17:09:59,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947157, now seen corresponding path program 1 times [2018-01-24 17:09:59,957 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:09:59,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:09:59,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:09:59,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:09:59,958 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:09:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:09:59,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:10:00,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-24 17:10:00,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:10:00,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:10:00,101 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:10:00,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 17:10:00,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 17:10:00,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 17:10:00,102 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 5 states. [2018-01-24 17:10:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:10:00,200 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-01-24 17:10:00,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:10:00,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 17:10:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:10:00,202 INFO L225 Difference]: With dead ends: 60 [2018-01-24 17:10:00,202 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 17:10:00,202 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:10:00,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 17:10:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-24 17:10:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 17:10:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-01-24 17:10:00,207 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 14 [2018-01-24 17:10:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:10:00,208 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-01-24 17:10:00,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 17:10:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-01-24 17:10:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 17:10:00,208 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:10:00,208 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:10:00,209 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-24 17:10:00,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947156, now seen corresponding path program 1 times [2018-01-24 17:10:00,209 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:10:00,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:00,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:10:00,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:00,210 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:10:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:10:00,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:10:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:10:00,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:10:00,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 17:10:00,339 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:10:00,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:10:00,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:10:00,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:10:00,340 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 6 states. [2018-01-24 17:10:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:10:00,484 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-01-24 17:10:00,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:10:00,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-24 17:10:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:10:00,486 INFO L225 Difference]: With dead ends: 59 [2018-01-24 17:10:00,486 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 17:10:00,487 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-24 17:10:00,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 17:10:00,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-24 17:10:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 17:10:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-01-24 17:10:00,493 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 14 [2018-01-24 17:10:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:10:00,494 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-01-24 17:10:00,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:10:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-01-24 17:10:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:10:00,495 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:10:00,495 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:10:00,495 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-24 17:10:00,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006569, now seen corresponding path program 1 times [2018-01-24 17:10:00,496 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:10:00,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:00,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:10:00,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:00,501 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:10:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:10:00,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:10:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:10:00,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:10:00,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 17:10:00,682 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:10:00,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 17:10:00,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 17:10:00,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:10:00,682 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 12 states. [2018-01-24 17:10:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:10:01,018 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-01-24 17:10:01,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 17:10:01,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-01-24 17:10:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:10:01,019 INFO L225 Difference]: With dead ends: 58 [2018-01-24 17:10:01,020 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 17:10:01,020 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-24 17:10:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 17:10:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-24 17:10:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 17:10:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-01-24 17:10:01,027 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 17 [2018-01-24 17:10:01,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:10:01,027 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-01-24 17:10:01,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 17:10:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-01-24 17:10:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:10:01,028 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:10:01,028 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:10:01,028 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-24 17:10:01,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006570, now seen corresponding path program 1 times [2018-01-24 17:10:01,028 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:10:01,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:01,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:10:01,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:01,029 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:10:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:10:01,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:10:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:10:01,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:10:01,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 17:10:01,222 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:10:01,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 17:10:01,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 17:10:01,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-24 17:10:01,223 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 12 states. [2018-01-24 17:10:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:10:01,527 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-01-24 17:10:01,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 17:10:01,528 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-01-24 17:10:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:10:01,529 INFO L225 Difference]: With dead ends: 57 [2018-01-24 17:10:01,529 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 17:10:01,529 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-24 17:10:01,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 17:10:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-24 17:10:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 17:10:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-01-24 17:10:01,535 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 17 [2018-01-24 17:10:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:10:01,535 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-01-24 17:10:01,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 17:10:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-01-24 17:10:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:10:01,536 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:10:01,536 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-24 17:10:01,536 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-24 17:10:01,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658956, now seen corresponding path program 1 times [2018-01-24 17:10:01,536 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:10:01,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:01,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:10:01,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:01,537 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:10:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:10:01,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:10:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:10:01,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:10:01,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 17:10:01,615 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:10:01,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 17:10:01,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 17:10:01,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:10:01,616 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 8 states. [2018-01-24 17:10:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:10:01,731 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-01-24 17:10:01,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:10:01,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-24 17:10:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:10:01,732 INFO L225 Difference]: With dead ends: 65 [2018-01-24 17:10:01,732 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 17:10:01,733 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-24 17:10:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 17:10:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-01-24 17:10:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 17:10:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-01-24 17:10:01,738 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 23 [2018-01-24 17:10:01,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:10:01,739 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-01-24 17:10:01,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 17:10:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-01-24 17:10:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:10:01,740 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:10:01,740 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-24 17:10:01,740 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-24 17:10:01,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658957, now seen corresponding path program 1 times [2018-01-24 17:10:01,740 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:10:01,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:01,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:10:01,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:01,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:10:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:10:01,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:10:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:10:01,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:10:01,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 17:10:01,863 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:10:01,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 17:10:01,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 17:10:01,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:10:01,864 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 9 states. [2018-01-24 17:10:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:10:01,950 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-24 17:10:01,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 17:10:01,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-24 17:10:01,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:10:01,951 INFO L225 Difference]: With dead ends: 54 [2018-01-24 17:10:01,952 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 17:10:01,952 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-24 17:10:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 17:10:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 17:10:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 17:10:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-01-24 17:10:01,957 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 23 [2018-01-24 17:10:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:10:01,957 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-01-24 17:10:01,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 17:10:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-01-24 17:10:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 17:10:01,958 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:10:01,958 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:10:01,959 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-24 17:10:01,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479601, now seen corresponding path program 1 times [2018-01-24 17:10:01,959 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:10:01,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:01,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:10:01,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:01,960 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:10:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:10:01,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:10:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:10:02,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:10:02,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-24 17:10:02,619 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:10:02,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 17:10:02,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 17:10:02,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-01-24 17:10:02,620 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-01-24 17:10:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:10:03,252 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-01-24 17:10:03,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 17:10:03,252 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-01-24 17:10:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:10:03,255 INFO L225 Difference]: With dead ends: 53 [2018-01-24 17:10:03,255 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 17:10:03,255 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2018-01-24 17:10:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 17:10:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-01-24 17:10:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 17:10:03,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-01-24 17:10:03,259 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2018-01-24 17:10:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:10:03,259 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-01-24 17:10:03,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 17:10:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-01-24 17:10:03,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 17:10:03,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:10:03,260 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:10:03,260 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-24 17:10:03,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479602, now seen corresponding path program 1 times [2018-01-24 17:10:03,260 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:10:03,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:03,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:10:03,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:03,261 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:10:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:10:03,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:10:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:10:03,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:10:03,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-24 17:10:03,554 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:10:03,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 17:10:03,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 17:10:03,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-01-24 17:10:03,555 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 18 states. [2018-01-24 17:10:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:10:04,057 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-01-24 17:10:04,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 17:10:04,058 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-01-24 17:10:04,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:10:04,058 INFO L225 Difference]: With dead ends: 51 [2018-01-24 17:10:04,058 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 17:10:04,059 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-24 17:10:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 17:10:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-24 17:10:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 17:10:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-01-24 17:10:04,064 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2018-01-24 17:10:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:10:04,065 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-01-24 17:10:04,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 17:10:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-01-24 17:10:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:10:04,066 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:10:04,066 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-24 17:10:04,066 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-24 17:10:04,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674501, now seen corresponding path program 1 times [2018-01-24 17:10:04,066 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:10:04,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:04,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:10:04,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:04,067 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:10:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:10:04,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:10:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:10:04,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:10:04,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-24 17:10:04,571 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:10:04,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 17:10:04,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 17:10:04,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-24 17:10:04,572 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 18 states. [2018-01-24 17:10:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:10:05,354 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-01-24 17:10:05,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 17:10:05,354 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-01-24 17:10:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:10:05,355 INFO L225 Difference]: With dead ends: 49 [2018-01-24 17:10:05,355 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 17:10:05,356 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-24 17:10:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 17:10:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-01-24 17:10:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 17:10:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-01-24 17:10:05,360 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 28 [2018-01-24 17:10:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:10:05,360 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-01-24 17:10:05,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 17:10:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-01-24 17:10:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 17:10:05,361 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:10:05,362 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-24 17:10:05,362 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-24 17:10:05,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674502, now seen corresponding path program 1 times [2018-01-24 17:10:05,362 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:10:05,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:05,363 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:10:05,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:05,363 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:10:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:10:05,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:10:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:10:05,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:10:05,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-24 17:10:05,792 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:10:05,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 17:10:05,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 17:10:05,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-24 17:10:05,793 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 18 states. [2018-01-24 17:10:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:10:06,684 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-01-24 17:10:06,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 17:10:06,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-01-24 17:10:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:10:06,687 INFO L225 Difference]: With dead ends: 48 [2018-01-24 17:10:06,687 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 17:10:06,688 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 17:10:06,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 17:10:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-24 17:10:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 17:10:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-01-24 17:10:06,692 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 28 [2018-01-24 17:10:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:10:06,693 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-01-24 17:10:06,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 17:10:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-01-24 17:10:06,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 17:10:06,694 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:10:06,694 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-24 17:10:06,694 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-24 17:10:06,694 INFO L82 PathProgramCache]: Analyzing trace with hash -38443497, now seen corresponding path program 1 times [2018-01-24 17:10:06,694 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:10:06,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:06,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:10:06,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:06,696 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:10:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:10:06,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:10:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:10:07,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:10:07,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-24 17:10:07,423 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:10:07,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 17:10:07,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 17:10:07,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-01-24 17:10:07,425 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-01-24 17:10:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:10:08,204 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-01-24 17:10:08,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 17:10:08,204 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-01-24 17:10:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:10:08,205 INFO L225 Difference]: With dead ends: 46 [2018-01-24 17:10:08,205 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 17:10:08,205 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-24 17:10:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 17:10:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-01-24 17:10:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 17:10:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-01-24 17:10:08,208 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-01-24 17:10:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:10:08,209 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-01-24 17:10:08,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 17:10:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-01-24 17:10:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 17:10:08,210 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:10:08,210 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-24 17:10:08,210 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-24 17:10:08,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1191748404, now seen corresponding path program 1 times [2018-01-24 17:10:08,211 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:10:08,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:08,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:10:08,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:08,212 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:10:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:10:08,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:10:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:10:08,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:10:08,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-24 17:10:08,744 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:10:08,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 17:10:08,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 17:10:08,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-01-24 17:10:08,745 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2018-01-24 17:10:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:10:09,445 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-01-24 17:10:09,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 17:10:09,446 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-01-24 17:10:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:10:09,446 INFO L225 Difference]: With dead ends: 45 [2018-01-24 17:10:09,446 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 17:10:09,447 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=1289, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 17:10:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 17:10:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-01-24 17:10:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 17:10:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-01-24 17:10:09,450 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 32 [2018-01-24 17:10:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:10:09,450 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-01-24 17:10:09,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 17:10:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-01-24 17:10:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 17:10:09,451 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:10:09,451 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-24 17:10:09,451 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-24 17:10:09,451 INFO L82 PathProgramCache]: Analyzing trace with hash -718496508, now seen corresponding path program 1 times [2018-01-24 17:10:09,451 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:10:09,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:09,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:10:09,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:10:09,452 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:10:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 17:10:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 17:10:09,521 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 17:10:09,540 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 17:10:09,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:10:09 BoogieIcfgContainer [2018-01-24 17:10:09,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:10:09,561 INFO L168 Benchmark]: Toolchain (without parser) took 11450.77 ms. Allocated memory was 307.2 MB in the beginning and 602.9 MB in the end (delta: 295.7 MB). Free memory was 267.2 MB in the beginning and 373.9 MB in the end (delta: -106.8 MB). Peak memory consumption was 188.9 MB. Max. memory is 5.3 GB. [2018-01-24 17:10:09,563 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 307.2 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:10:09,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.80 ms. Allocated memory is still 307.2 MB. Free memory was 266.2 MB in the beginning and 256.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:10:09,563 INFO L168 Benchmark]: Boogie Preprocessor took 41.38 ms. Allocated memory is still 307.2 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:10:09,563 INFO L168 Benchmark]: RCFGBuilder took 368.22 ms. Allocated memory is still 307.2 MB. Free memory was 254.1 MB in the beginning and 232.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:10:09,564 INFO L168 Benchmark]: TraceAbstraction took 10809.96 ms. Allocated memory was 307.2 MB in the beginning and 602.9 MB in the end (delta: 295.7 MB). Free memory was 231.2 MB in the beginning and 373.9 MB in the end (delta: -142.8 MB). Peak memory consumption was 152.9 MB. Max. memory is 5.3 GB. [2018-01-24 17:10:09,565 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.18 ms. Allocated memory is still 307.2 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.80 ms. Allocated memory is still 307.2 MB. Free memory was 266.2 MB in the beginning and 256.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.38 ms. Allocated memory is still 307.2 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 368.22 ms. Allocated memory is still 307.2 MB. Free memory was 254.1 MB in the beginning and 232.1 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10809.96 ms. Allocated memory was 307.2 MB in the beginning and 602.9 MB in the end (delta: 295.7 MB). Free memory was 231.2 MB in the beginning and 373.9 MB in the end (delta: -142.8 MB). Peak memory consumption was 152.9 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))={12:0}, malloc(sizeof(int))={14: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))={12:0}, malloc(sizeof(int))={14: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.7s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 6.0s 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.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 6.2s 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, 4.0s 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_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-10-09-573.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_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-10-09-573.csv Received shutdown request...