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_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:38:31,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:38:31,493 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:38:31,508 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:38:31,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:38:31,509 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:38:31,510 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:38:31,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:38:31,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:38:31,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:38:31,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:38:31,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:38:31,515 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:38:31,516 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:38:31,516 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:38:31,519 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:38:31,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:38:31,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:38:31,524 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:38:31,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:38:31,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:38:31,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:38:31,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:38:31,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:38:31,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:38:31,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:38:31,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:38:31,533 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:38:31,533 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:38:31,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:38:31,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:38:31,534 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:38:31,544 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:38:31,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:38:31,545 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:38:31,545 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:38:31,545 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:38:31,545 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:38:31,546 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:38:31,546 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:38:31,546 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:38:31,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:38:31,547 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:38:31,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:38:31,547 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:38:31,547 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:38:31,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:38:31,548 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:38:31,548 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:38:31,548 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:38:31,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:38:31,549 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:38:31,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:38:31,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:38:31,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:38:31,549 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:38:31,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:38:31,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:38:31,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:38:31,550 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:38:31,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:38:31,551 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:38:31,551 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:38:31,551 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:38:31,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:38:31,551 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:38:31,551 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:38:31,552 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:38:31,552 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:38:31,587 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:38:31,599 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:38:31,603 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:38:31,605 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:38:31,605 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:38:31,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2018-01-24 20:38:31,809 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:38:31,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:38:31,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:38:31,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:38:31,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:38:31,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:38:31" (1/1) ... [2018-01-24 20:38:31,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c0846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:38:31, skipping insertion in model container [2018-01-24 20:38:31,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:38:31" (1/1) ... [2018-01-24 20:38:31,836 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:38:31,886 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:38:32,003 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:38:32,021 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:38:32,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:38:32 WrapperNode [2018-01-24 20:38:32,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:38:32,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:38:32,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:38:32,028 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:38:32,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:38:32" (1/1) ... [2018-01-24 20:38:32,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:38:32" (1/1) ... [2018-01-24 20:38:32,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:38:32" (1/1) ... [2018-01-24 20:38:32,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:38:32" (1/1) ... [2018-01-24 20:38:32,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:38:32" (1/1) ... [2018-01-24 20:38:32,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:38:32" (1/1) ... [2018-01-24 20:38:32,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:38:32" (1/1) ... [2018-01-24 20:38:32,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:38:32,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:38:32,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:38:32,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:38:32,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:38:32" (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:38:32,116 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:38:32,116 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:38:32,116 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 20:38:32,117 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-24 20:38:32,117 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-24 20:38:32,117 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 20:38:32,117 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:38:32,117 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:38:32,117 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:38:32,118 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:38:32,118 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:38:32,118 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:38:32,118 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:38:32,118 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:38:32,118 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:38:32,119 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 20:38:32,119 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-24 20:38:32,119 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-24 20:38:32,119 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 20:38:32,119 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:38:32,119 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:38:32,119 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:38:32,387 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:38:32,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:38:32 BoogieIcfgContainer [2018-01-24 20:38:32,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:38:32,390 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:38:32,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:38:32,392 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:38:32,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:38:31" (1/3) ... [2018-01-24 20:38:32,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601262f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:38:32, skipping insertion in model container [2018-01-24 20:38:32,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:38:32" (2/3) ... [2018-01-24 20:38:32,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601262f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:38:32, skipping insertion in model container [2018-01-24 20:38:32,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:38:32" (3/3) ... [2018-01-24 20:38:32,396 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-01-24 20:38:32,404 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:38:32,410 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 20:38:32,449 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:38:32,449 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:38:32,449 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:38:32,449 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:38:32,449 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:38:32,449 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:38:32,450 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:38:32,450 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:38:32,450 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:38:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-24 20:38:32,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 20:38:32,475 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:38:32,476 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 20:38:32,476 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]=== [2018-01-24 20:38:32,480 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-01-24 20:38:32,482 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:38:32,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:32,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:38:32,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:32,529 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:38:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:38:32,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:38:32,674 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:38:32,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:38:32,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:38:32,677 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:38:32,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:38:32,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:38:32,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:38:32,700 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-01-24 20:38:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:38:32,986 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-01-24 20:38:32,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:38:32,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 20:38:32,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:38:32,999 INFO L225 Difference]: With dead ends: 178 [2018-01-24 20:38:33,000 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 20:38:33,004 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:38:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 20:38:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-01-24 20:38:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 20:38:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-01-24 20:38:33,056 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-01-24 20:38:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:38:33,056 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-01-24 20:38:33,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:38:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-01-24 20:38:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 20:38:33,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:38:33,058 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 20:38:33,058 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]=== [2018-01-24 20:38:33,059 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-01-24 20:38:33,059 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:38:33,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:33,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:38:33,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:33,061 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:38:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:38:33,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:38:33,145 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:38:33,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:38:33,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:38:33,146 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:38:33,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:38:33,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:38:33,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:38:33,149 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-01-24 20:38:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:38:33,190 INFO L93 Difference]: Finished difference Result 176 states and 206 transitions. [2018-01-24 20:38:33,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:38:33,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 20:38:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:38:33,193 INFO L225 Difference]: With dead ends: 176 [2018-01-24 20:38:33,193 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 20:38:33,194 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:38:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 20:38:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-01-24 20:38:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 20:38:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-01-24 20:38:33,205 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-01-24 20:38:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:38:33,205 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-01-24 20:38:33,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:38:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-01-24 20:38:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 20:38:33,206 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:38:33,206 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:38:33,206 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]=== [2018-01-24 20:38:33,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-01-24 20:38:33,207 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:38:33,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:33,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:38:33,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:33,209 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:38:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:38:33,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:38:33,275 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:38:33,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:38:33,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:38:33,276 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:38:33,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:38:33,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:38:33,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:38:33,277 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-01-24 20:38:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:38:33,311 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-01-24 20:38:33,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:38:33,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 20:38:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:38:33,312 INFO L225 Difference]: With dead ends: 76 [2018-01-24 20:38:33,312 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 20:38:33,313 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:38:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 20:38:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-24 20:38:33,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 20:38:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-24 20:38:33,321 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-01-24 20:38:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:38:33,321 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-24 20:38:33,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:38:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-24 20:38:33,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 20:38:33,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:38:33,323 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:38:33,323 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]=== [2018-01-24 20:38:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-01-24 20:38:33,323 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:38:33,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:33,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:38:33,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:33,325 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:38:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:38:33,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:38:33,394 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:38:33,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:38:33,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:38:33,395 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:38:33,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:38:33,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:38:33,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:38:33,395 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-01-24 20:38:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:38:33,492 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-01-24 20:38:33,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:38:33,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 20:38:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:38:33,493 INFO L225 Difference]: With dead ends: 72 [2018-01-24 20:38:33,493 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 20:38:33,494 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:38:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 20:38:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-24 20:38:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 20:38:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-24 20:38:33,502 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-01-24 20:38:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:38:33,502 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-24 20:38:33,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:38:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-24 20:38:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 20:38:33,503 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:38:33,503 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:38:33,503 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]=== [2018-01-24 20:38:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-01-24 20:38:33,504 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:38:33,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:33,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:38:33,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:33,506 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:38:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:38:33,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:38:33,821 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:38:33,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:38:33,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:38:33,822 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:38:33,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 20:38:33,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 20:38:33,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-24 20:38:33,823 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-01-24 20:38:34,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:38:34,045 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2018-01-24 20:38:34,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 20:38:34,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 20:38:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:38:34,047 INFO L225 Difference]: With dead ends: 132 [2018-01-24 20:38:34,047 INFO L226 Difference]: Without dead ends: 75 [2018-01-24 20:38:34,048 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 20:38:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-24 20:38:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-01-24 20:38:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 20:38:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-01-24 20:38:34,056 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-01-24 20:38:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:38:34,057 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-01-24 20:38:34,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 20:38:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-01-24 20:38:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 20:38:34,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:38:34,058 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] [2018-01-24 20:38:34,058 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]=== [2018-01-24 20:38:34,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-01-24 20:38:34,058 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:38:34,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:34,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:38:34,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:34,060 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:38:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:38:34,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:38:34,449 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:38:34,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:38:34,449 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:38:34,450 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 20:38:34,452 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [92], [94], [98], [102], [107], [108], [110], [112], [120], [124], [125], [126], [128], [129] [2018-01-24 20:38:34,494 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:38:34,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:38:53,161 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 20:38:53,163 INFO L268 AbstractInterpreter]: Visited 21 different actions 26 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-24 20:38:53,179 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 20:38:53,180 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:38:53,180 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:38:53,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:38:53,186 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:38:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:38:53,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:38:53,278 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:38:53,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:38:53,306 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:38:53,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:38:53,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:38:53,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 20:38:53,667 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:38:53,667 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:38:54,134 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:38:54,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:38:54,155 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 20:38:54,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:38:54,159 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:38:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:38:54,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:38:54,193 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:38:54,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:38:54,208 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:38:54,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:38:54,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:38:54,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 20:38:54,288 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:38:54,288 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:38:54,894 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:38:54,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 20:38:54,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 31 [2018-01-24 20:38:54,897 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 20:38:54,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 20:38:54,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 20:38:54,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-01-24 20:38:54,898 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 18 states. [2018-01-24 20:38:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:38:55,346 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-01-24 20:38:55,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:38:55,347 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-24 20:38:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:38:55,348 INFO L225 Difference]: With dead ends: 136 [2018-01-24 20:38:55,348 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 20:38:55,348 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 20:38:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 20:38:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-01-24 20:38:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 20:38:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-01-24 20:38:55,355 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 23 [2018-01-24 20:38:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:38:55,355 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-01-24 20:38:55,355 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 20:38:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-01-24 20:38:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 20:38:55,356 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:38:55,356 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:38:55,356 INFO L371 AbstractCegarLoop]: === Iteration 7 === [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]=== [2018-01-24 20:38:55,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-01-24 20:38:55,357 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:38:55,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:55,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:38:55,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:38:55,358 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:38:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:38:55,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:38:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:38:55,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:38:55,744 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:38:55,744 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 20:38:55,744 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 20:38:55,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:38:55,744 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 20:38:55,754 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 20:38:55,754 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 20:38:55,766 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 20:38:55,770 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 20:38:55,771 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 20:38:55,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:38:55,792 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:38:55,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:38:55,806 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:38:55,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:38:55,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:38:55,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 20:38:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:38:56,191 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:38:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:38:59,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:38:59,341 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 20:38:59,344 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 20:38:59,345 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 20:38:59,359 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 20:38:59,379 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 20:38:59,389 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 20:38:59,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:38:59,408 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:38:59,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:38:59,431 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:38:59,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:38:59,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:38:59,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 20:38:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:38:59,566 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:39:00,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:39:00,672 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 20:39:00,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11, 10, 11] total 38 [2018-01-24 20:39:00,673 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 20:39:00,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 20:39:00,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 20:39:00,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1324, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 20:39:00,674 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 21 states. [2018-01-24 20:39:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:39:01,118 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-24 20:39:01,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 20:39:01,119 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-01-24 20:39:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:39:01,119 INFO L225 Difference]: With dead ends: 140 [2018-01-24 20:39:01,119 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 20:39:01,120 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=260, Invalid=1810, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 20:39:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 20:39:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-01-24 20:39:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 20:39:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-01-24 20:39:01,129 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 27 [2018-01-24 20:39:01,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:39:01,129 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-01-24 20:39:01,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 20:39:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-01-24 20:39:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 20:39:01,130 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:39:01,130 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:39:01,130 INFO L371 AbstractCegarLoop]: === Iteration 8 === [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]=== [2018-01-24 20:39:01,131 INFO L82 PathProgramCache]: Analyzing trace with hash -449495888, now seen corresponding path program 3 times [2018-01-24 20:39:01,131 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:39:01,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:01,132 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 20:39:01,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:01,132 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:39:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:39:01,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:39:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:39:01,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:39:01,432 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:39:01,432 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 20:39:01,432 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 20:39:01,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:39:01,432 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 20:39:01,438 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 20:39:01,439 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 20:39:01,449 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 20:39:01,452 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 20:39:01,454 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 20:39:01,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:39:01,485 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:39:01,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:01,497 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:39:01,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:01,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:39:01,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 20:39:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 20:39:04,024 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:39:04,321 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 216 [2018-01-24 20:39:23,522 WARN L152 XnfTransformerHelper]: Simplifying conjuction of 9656 disjunctions. This might take some time... [2018-01-24 20:39:23,558 INFO L170 XnfTransformerHelper]: Simplified to conjuction of 3 disjunctions. [2018-01-24 20:39:25,722 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 125 [2018-01-24 20:39:26,581 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 216 Received shutdown request... [2018-01-24 20:39:32,464 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 20:39:32,465 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 20:39:32,468 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 20:39:32,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:39:32 BoogieIcfgContainer [2018-01-24 20:39:32,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:39:32,469 INFO L168 Benchmark]: Toolchain (without parser) took 60659.91 ms. Allocated memory was 304.6 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 263.5 MB in the beginning and 1.2 GB in the end (delta: -980.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-24 20:39:32,469 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:39:32,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.19 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 249.6 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:39:32,470 INFO L168 Benchmark]: Boogie Preprocessor took 36.74 ms. Allocated memory is still 304.6 MB. Free memory was 249.6 MB in the beginning and 248.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 20:39:32,470 INFO L168 Benchmark]: RCFGBuilder took 323.83 ms. Allocated memory is still 304.6 MB. Free memory was 248.6 MB in the beginning and 225.4 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. [2018-01-24 20:39:32,470 INFO L168 Benchmark]: TraceAbstraction took 60078.86 ms. Allocated memory was 304.6 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 225.4 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-24 20:39:32,472 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 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.19 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 249.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.74 ms. Allocated memory is still 304.6 MB. Free memory was 249.6 MB in the beginning and 248.6 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 323.83 ms. Allocated memory is still 304.6 MB. Free memory was 248.6 MB in the beginning and 225.4 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60078.86 ms. Allocated memory was 304.6 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 225.4 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 123 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.385383 RENAME_VARIABLES(MILLISECONDS) : 0.713511 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.348347 PROJECTAWAY(MILLISECONDS) : 1.905475 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.090151 DISJOIN(MILLISECONDS) : 1.445227 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.736699 ADD_EQUALITY(MILLISECONDS) : 0.018423 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008370 #CONJOIN_DISJUNCTIVE : 42 #RENAME_VARIABLES : 69 #UNFREEZE : 0 #CONJOIN : 82 #PROJECTAWAY : 67 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 66 #ADD_EQUALITY : 51 #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 1451). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while CnfTransformerHelper was transforming 216 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 73 locations, 15 error locations. TIMEOUT Result, 60.0s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 482 SDtfs, 210 SDslu, 2145 SDs, 0 SdLazy, 733 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 268 GetRequests, 142 SyntacticMatches, 20 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 18.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 39 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 326 ConstructedInterpolants, 64 QuantifiedInterpolants, 134280 SizeOfPredicates, 20 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 0/65 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_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-39-32-482.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_20-39-32-482.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_20-39-32-482.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-39-32-482.csv Completed graceful shutdown