java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:44:47,966 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:44:47,968 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:44:47,980 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:44:47,981 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:44:47,982 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:44:47,983 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:44:47,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:44:47,987 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:44:47,988 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:44:47,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:44:47,989 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:44:47,990 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:44:47,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:44:47,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:44:47,995 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:44:47,997 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:44:47,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:44:48,001 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:44:48,002 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:44:48,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:44:48,004 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:44:48,005 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:44:48,006 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:44:48,007 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:44:48,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:44:48,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:44:48,009 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:44:48,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:44:48,009 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:44:48,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:44:48,010 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf [2018-01-24 20:44:48,021 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:44:48,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:44:48,022 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:44:48,022 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:44:48,022 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:44:48,023 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:44:48,023 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:44:48,023 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:44:48,023 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:44:48,024 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:44:48,024 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:44:48,024 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:44:48,024 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:44:48,025 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:44:48,025 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:44:48,025 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:44:48,025 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:44:48,025 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:44:48,025 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:44:48,026 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:44:48,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:44:48,026 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:44:48,026 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:44:48,027 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:44:48,027 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:44:48,027 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:44:48,027 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:44:48,027 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:44:48,028 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:44:48,028 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:44:48,028 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:44:48,028 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:44:48,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:44:48,029 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:44:48,029 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:44:48,030 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:44:48,030 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:44:48,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:44:48,079 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:44:48,084 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:44:48,085 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:44:48,086 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:44:48,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-24 20:44:48,280 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:44:48,287 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:44:48,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:44:48,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:44:48,294 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:44:48,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:44:48" (1/1) ... [2018-01-24 20:44:48,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a251b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:44:48, skipping insertion in model container [2018-01-24 20:44:48,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:44:48" (1/1) ... [2018-01-24 20:44:48,315 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:44:48,366 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:44:48,483 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:44:48,501 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:44:48,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:44:48 WrapperNode [2018-01-24 20:44:48,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:44:48,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:44:48,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:44:48,511 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:44:48,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:44:48" (1/1) ... [2018-01-24 20:44:48,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:44:48" (1/1) ... [2018-01-24 20:44:48,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:44:48" (1/1) ... [2018-01-24 20:44:48,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:44:48" (1/1) ... [2018-01-24 20:44:48,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:44:48" (1/1) ... [2018-01-24 20:44:48,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:44:48" (1/1) ... [2018-01-24 20:44:48,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:44:48" (1/1) ... [2018-01-24 20:44:48,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:44:48,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:44:48,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:44:48,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:44:48,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:44:48" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:44:48,607 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:44:48,607 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:44:48,607 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-01-24 20:44:48,607 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 20:44:48,607 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-24 20:44:48,608 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 20:44:48,608 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 20:44:48,608 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:44:48,608 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:44:48,608 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:44:48,608 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:44:48,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:44:48,609 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:44:48,609 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:44:48,609 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:44:48,609 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:44:48,609 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-01-24 20:44:48,610 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 20:44:48,610 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-24 20:44:48,610 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-24 20:44:48,610 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 20:44:48,610 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 20:44:48,611 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:44:48,611 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:44:48,611 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:44:48,906 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:44:48,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:44:48 BoogieIcfgContainer [2018-01-24 20:44:48,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:44:48,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:44:48,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:44:48,910 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:44:48,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:44:48" (1/3) ... [2018-01-24 20:44:48,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cc5af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:44:48, skipping insertion in model container [2018-01-24 20:44:48,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:44:48" (2/3) ... [2018-01-24 20:44:48,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cc5af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:44:48, skipping insertion in model container [2018-01-24 20:44:48,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:44:48" (3/3) ... [2018-01-24 20:44:48,915 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i [2018-01-24 20:44:48,924 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:44:48,936 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-24 20:44:48,979 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:44:48,980 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:44:48,980 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:44:48,980 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:44:48,980 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:44:48,980 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:44:48,980 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:44:48,981 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:44:48,981 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:44:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-01-24 20:44:49,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 20:44:49,010 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:44:49,011 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 20:44:49,011 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:44:49,016 INFO L82 PathProgramCache]: Analyzing trace with hash 280514151, now seen corresponding path program 1 times [2018-01-24 20:44:49,019 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:44:49,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:44:49,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:44:49,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:44:49,068 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:44:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:44:49,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:44:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:44:49,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:44:49,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:44:49,238 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:44:49,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:44:49,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:44:49,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:44:49,387 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-01-24 20:44:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:44:49,635 INFO L93 Difference]: Finished difference Result 193 states and 234 transitions. [2018-01-24 20:44:49,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:44:49,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-24 20:44:49,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:44:49,648 INFO L225 Difference]: With dead ends: 193 [2018-01-24 20:44:49,648 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 20:44:49,653 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:44:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 20:44:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2018-01-24 20:44:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 20:44:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-24 20:44:49,700 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 23 [2018-01-24 20:44:49,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:44:49,701 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-24 20:44:49,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:44:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-24 20:44:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 20:44:49,704 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:44:49,704 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 20:44:49,704 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:44:49,704 INFO L82 PathProgramCache]: Analyzing trace with hash 279746761, now seen corresponding path program 1 times [2018-01-24 20:44:49,705 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:44:49,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:44:49,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:44:49,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:44:49,707 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:44:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:44:49,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:44:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:44:49,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:44:49,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:44:49,816 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:44:49,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:44:49,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:44:49,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:44:49,818 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states. [2018-01-24 20:44:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:44:49,853 INFO L93 Difference]: Finished difference Result 150 states and 164 transitions. [2018-01-24 20:44:49,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:44:49,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-24 20:44:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:44:49,855 INFO L225 Difference]: With dead ends: 150 [2018-01-24 20:44:49,855 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 20:44:49,857 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:44:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 20:44:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-01-24 20:44:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 20:44:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-01-24 20:44:49,864 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23 [2018-01-24 20:44:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:44:49,864 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-01-24 20:44:49,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:44:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-01-24 20:44:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 20:44:49,865 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:44:49,865 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:44:49,865 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:44:49,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1161746679, now seen corresponding path program 1 times [2018-01-24 20:44:49,865 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:44:49,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:44:49,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:44:49,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:44:49,867 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:44:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:44:49,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:44:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:44:49,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:44:49,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:44:49,937 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:44:49,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:44:49,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:44:49,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:44:49,938 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-01-24 20:44:50,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:44:50,033 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-01-24 20:44:50,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:44:50,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 20:44:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:44:50,036 INFO L225 Difference]: With dead ends: 85 [2018-01-24 20:44:50,036 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 20:44:50,036 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:44:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 20:44:50,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-24 20:44:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 20:44:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-24 20:44:50,044 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 25 [2018-01-24 20:44:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:44:50,045 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-24 20:44:50,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:44:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-24 20:44:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 20:44:50,046 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:44:50,046 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:44:50,046 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:44:50,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514069, now seen corresponding path program 1 times [2018-01-24 20:44:50,046 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:44:50,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:44:50,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:44:50,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:44:50,048 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:44:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:44:50,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:44:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:44:50,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:44:50,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:44:50,105 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:44:50,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:44:50,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:44:50,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:44:50,106 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2018-01-24 20:44:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:44:50,263 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-01-24 20:44:50,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:44:50,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 20:44:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:44:50,265 INFO L225 Difference]: With dead ends: 81 [2018-01-24 20:44:50,266 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 20:44:50,266 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:44:50,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 20:44:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-24 20:44:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 20:44:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-01-24 20:44:50,276 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25 [2018-01-24 20:44:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:44:50,276 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-01-24 20:44:50,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:44:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-01-24 20:44:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 20:44:50,277 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:44:50,277 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:44:50,278 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:44:50,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514068, now seen corresponding path program 1 times [2018-01-24 20:44:50,278 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:44:50,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:44:50,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:44:50,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:44:50,280 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:44:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:44:50,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:44:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:44:50,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:44:50,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 20:44:50,590 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:44:50,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 20:44:50,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 20:44:50,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-24 20:44:50,591 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 11 states. [2018-01-24 20:44:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:44:50,841 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-01-24 20:44:50,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 20:44:50,843 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-01-24 20:44:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:44:50,845 INFO L225 Difference]: With dead ends: 144 [2018-01-24 20:44:50,845 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 20:44:50,846 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-01-24 20:44:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 20:44:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-01-24 20:44:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 20:44:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-24 20:44:50,855 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 25 [2018-01-24 20:44:50,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:44:50,856 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-24 20:44:50,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 20:44:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-24 20:44:50,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 20:44:50,857 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:44:50,857 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:44:50,857 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:44:50,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1767740413, now seen corresponding path program 1 times [2018-01-24 20:44:50,858 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:44:50,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:44:50,860 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:44:50,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:44:50,860 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:44:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:44:50,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:44:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:44:51,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:44:51,118 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:44:51,119 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 20:44:51,121 INFO L201 CegarAbsIntRunner]: [0], [3], [5], [9], [12], [13], [14], [16], [17], [18], [98], [100], [102], [105], [109], [114], [115], [117], [119], [133], [137], [138], [139], [141], [142], [143], [144] [2018-01-24 20:44:51,162 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:44:51,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:45:02,670 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 20:45:02,672 INFO L268 AbstractInterpreter]: Visited 27 different actions 32 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-24 20:45:02,679 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 20:45:02,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:45:02,679 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 20:45:02,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:45:02,695 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:45:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:45:02,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:45:02,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 20:45:02,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:02,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 20:45:02,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:45:02,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:45:02,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 20:45:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:45:03,348 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:45:03,712 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 125 [2018-01-24 20:45:07,183 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 125 [2018-01-24 20:45:08,114 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 125 [2018-01-24 20:45:11,067 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 16128 conjuctions. This might take some time... [2018-01-24 20:45:22,903 INFO L170 XnfTransformerHelper]: Simplified to disjunction of 16128 conjuctions. [2018-01-24 20:45:24,704 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16128 Received shutdown request... [2018-01-24 20:45:48,146 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 20:45:48,146 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 20:45:48,150 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 20:45:48,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:45:48 BoogieIcfgContainer [2018-01-24 20:45:48,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:45:48,151 INFO L168 Benchmark]: Toolchain (without parser) took 59870.65 ms. Allocated memory was 305.1 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 262.4 MB in the beginning and 544.4 MB in the end (delta: -281.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-01-24 20:45:48,152 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:45:48,152 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.39 ms. Allocated memory is still 305.1 MB. Free memory was 262.4 MB in the beginning and 248.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:45:48,152 INFO L168 Benchmark]: Boogie Preprocessor took 38.31 ms. Allocated memory is still 305.1 MB. Free memory was 248.5 MB in the beginning and 246.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:45:48,152 INFO L168 Benchmark]: RCFGBuilder took 356.69 ms. Allocated memory is still 305.1 MB. Free memory was 246.5 MB in the beginning and 224.0 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-01-24 20:45:48,152 INFO L168 Benchmark]: TraceAbstraction took 59242.85 ms. Allocated memory was 305.1 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 224.0 MB in the beginning and 544.4 MB in the end (delta: -320.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-01-24 20:45:48,154 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 305.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.39 ms. Allocated memory is still 305.1 MB. Free memory was 262.4 MB in the beginning and 248.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.31 ms. Allocated memory is still 305.1 MB. Free memory was 248.5 MB in the beginning and 246.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 356.69 ms. Allocated memory is still 305.1 MB. Free memory was 246.5 MB in the beginning and 224.0 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 59242.85 ms. Allocated memory was 305.1 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 224.0 MB in the beginning and 544.4 MB in the end (delta: -320.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 4 LocStat_NO_SUPPORTING_EQUALITIES : 138 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 4 TransStat_NO_SUPPORTING_EQUALITIES : 53 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 39 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.432852 RENAME_VARIABLES(MILLISECONDS) : 2.023906 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.387814 PROJECTAWAY(MILLISECONDS) : 2.646059 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.106937 DISJOIN(MILLISECONDS) : 2.031256 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.059478 ADD_EQUALITY(MILLISECONDS) : 0.016951 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008705 #CONJOIN_DISJUNCTIVE : 51 #RENAME_VARIABLES : 86 #UNFREEZE : 0 #CONJOIN : 100 #PROJECTAWAY : 86 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 83 #ADD_EQUALITY : 54 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1480]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1480). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 16128 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 82 locations, 17 error locations. TIMEOUT Result, 59.1s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 393 SDtfs, 104 SDslu, 1363 SDs, 0 SdLazy, 344 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 11.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 47 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 8616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-45-48-162.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_20-45-48-162.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_20-45-48-162.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-45-48-162.csv Completed graceful shutdown