java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:01:54,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:01:54,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:01:54,201 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:01:54,201 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:01:54,202 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:01:54,203 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:01:54,205 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:01:54,206 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:01:54,207 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:01:54,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:01:54,208 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:01:54,208 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:01:54,209 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:01:54,210 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:01:54,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:01:54,215 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:01:54,217 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:01:54,218 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:01:54,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:01:54,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:01:54,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:01:54,223 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:01:54,224 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:01:54,225 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:01:54,226 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:01:54,226 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:01:54,227 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:01:54,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:01:54,227 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:01:54,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:01:54,229 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:01:54,239 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:01:54,239 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:01:54,240 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:01:54,241 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:01:54,241 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:01:54,241 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:01:54,241 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:01:54,241 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:01:54,242 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:01:54,242 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:01:54,242 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:01:54,243 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:01:54,243 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:01:54,243 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:01:54,243 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:01:54,243 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:01:54,244 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:01:54,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:01:54,244 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:01:54,244 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:01:54,244 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:01:54,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:01:54,245 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:01:54,245 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:01:54,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:01:54,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:01:54,246 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:01:54,246 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:01:54,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:01:54,246 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:01:54,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:01:54,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:01:54,247 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:01:54,247 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:01:54,248 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:01:54,248 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:01:54,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:01:54,297 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:01:54,301 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:01:54,303 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:01:54,304 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:01:54,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-01-25 06:01:54,509 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:01:54,516 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:01:54,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:01:54,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:01:54,522 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:01:54,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:01:54" (1/1) ... [2018-01-25 06:01:54,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d3d535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:54, skipping insertion in model container [2018-01-25 06:01:54,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:01:54" (1/1) ... [2018-01-25 06:01:54,548 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:01:54,602 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:01:54,716 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:01:54,735 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:01:54,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:54 WrapperNode [2018-01-25 06:01:54,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:01:54,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:01:54,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:01:54,745 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:01:54,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:54" (1/1) ... [2018-01-25 06:01:54,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:54" (1/1) ... [2018-01-25 06:01:54,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:54" (1/1) ... [2018-01-25 06:01:54,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:54" (1/1) ... [2018-01-25 06:01:54,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:54" (1/1) ... [2018-01-25 06:01:54,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:54" (1/1) ... [2018-01-25 06:01:54,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:54" (1/1) ... [2018-01-25 06:01:54,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:01:54,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:01:54,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:01:54,788 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:01:54,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:54" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:01:54,835 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:01:54,836 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:01:54,836 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:01:54,836 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-01-25 06:01:54,836 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-25 06:01:54,836 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:01:54,836 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:01:54,836 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:01:54,837 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:01:54,837 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:01:54,837 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:01:54,837 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:01:54,837 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:01:54,837 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:01:54,838 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:01:54,838 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:01:54,838 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-01-25 06:01:54,838 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-25 06:01:54,838 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:01:54,838 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:01:54,839 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:01:54,839 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:01:55,114 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:01:55,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:01:55 BoogieIcfgContainer [2018-01-25 06:01:55,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:01:55,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:01:55,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:01:55,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:01:55,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:01:54" (1/3) ... [2018-01-25 06:01:55,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77834cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:01:55, skipping insertion in model container [2018-01-25 06:01:55,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:01:54" (2/3) ... [2018-01-25 06:01:55,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77834cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:01:55, skipping insertion in model container [2018-01-25 06:01:55,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:01:55" (3/3) ... [2018-01-25 06:01:55,120 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-01-25 06:01:55,126 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:01:55,132 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 06:01:55,181 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:01:55,181 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:01:55,181 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:01:55,182 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:01:55,182 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:01:55,182 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:01:55,182 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:01:55,182 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:01:55,183 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:01:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-25 06:01:55,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:01:55,208 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:55,209 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:55,209 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:01:55,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-01-25 06:01:55,215 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:55,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:55,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:55,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:55,266 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:55,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:55,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:55,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:01:55,428 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:55,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:01:55,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:01:55,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:01:55,449 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-01-25 06:01:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:55,712 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-01-25 06:01:55,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:01:55,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 06:01:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:55,728 INFO L225 Difference]: With dead ends: 178 [2018-01-25 06:01:55,728 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 06:01:55,733 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-25 06:01:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 06:01:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-01-25 06:01:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 06:01:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-01-25 06:01:55,788 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-01-25 06:01:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:55,788 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-01-25 06:01:55,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:01:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-01-25 06:01:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:01:55,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:55,791 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:01:55,791 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:01:55,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-01-25 06:01:55,791 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:55,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:55,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:55,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:55,794 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:55,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:55,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:55,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:01:55,891 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:55,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:01:55,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:01:55,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:01:55,893 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-01-25 06:01:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:55,936 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2018-01-25 06:01:55,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:01:55,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 06:01:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:55,938 INFO L225 Difference]: With dead ends: 136 [2018-01-25 06:01:55,938 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 06:01:55,939 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-25 06:01:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 06:01:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-01-25 06:01:55,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 06:01:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-01-25 06:01:55,947 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-01-25 06:01:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:55,947 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-01-25 06:01:55,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:01:55,947 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-01-25 06:01:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:01:55,948 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:55,948 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-25 06:01:55,948 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:01:55,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-01-25 06:01:55,948 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:55,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:55,950 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:55,950 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:55,950 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:55,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:56,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:56,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:01:56,025 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:56,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:01:56,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:01:56,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:01:56,025 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-01-25 06:01:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:56,083 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-25 06:01:56,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:01:56,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:01:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:56,085 INFO L225 Difference]: With dead ends: 75 [2018-01-25 06:01:56,085 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 06:01:56,086 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-25 06:01:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 06:01:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-25 06:01:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 06:01:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-25 06:01:56,094 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-01-25 06:01:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:56,095 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-25 06:01:56,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:01:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-25 06:01:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:01:56,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:56,096 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-25 06:01:56,096 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:01:56,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-01-25 06:01:56,097 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:56,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:56,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:56,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:56,099 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:56,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:56,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:56,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:01:56,172 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:56,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:01:56,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:01:56,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:01:56,173 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-01-25 06:01:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:56,267 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-25 06:01:56,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:01:56,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:01:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:56,268 INFO L225 Difference]: With dead ends: 71 [2018-01-25 06:01:56,269 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 06:01:56,269 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-25 06:01:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 06:01:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-25 06:01:56,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 06:01:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-25 06:01:56,276 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-01-25 06:01:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:56,276 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-25 06:01:56,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:01:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-25 06:01:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:01:56,277 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:56,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] [2018-01-25 06:01:56,277 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:01:56,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-01-25 06:01:56,277 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:56,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:56,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:56,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:56,279 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:56,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:01:56,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:01:56,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 06:01:56,597 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:01:56,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 06:01:56,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 06:01:56,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:01:56,598 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-01-25 06:01:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:01:56,858 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-01-25 06:01:56,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:01:56,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 06:01:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:01:56,860 INFO L225 Difference]: With dead ends: 130 [2018-01-25 06:01:56,860 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 06:01:56,861 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-25 06:01:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 06:01:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-01-25 06:01:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 06:01:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-01-25 06:01:56,869 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-01-25 06:01:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:01:56,869 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-01-25 06:01:56,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 06:01:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-01-25 06:01:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 06:01:56,870 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:01:56,870 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-25 06:01:56,871 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:01:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-01-25 06:01:56,871 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:01:56,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:56,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:56,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:01:56,872 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:01:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:56,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:01:57,138 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-25 06:01:57,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:57,138 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:01:57,140 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 06:01:57,142 INFO L201 CegarAbsIntRunner]: [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [103], [104], [106], [108], [119], [123], [124], [125], [127], [128] [2018-01-25 06:01:57,186 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:01:57,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:01:57,823 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:01:57,825 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-25 06:01:57,835 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:01:57,835 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:57,836 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-25 06:01:57,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:57,851 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:57,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:58,045 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-25 06:01:58,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:58,117 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-25 06:01:58,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:58,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:01:58,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 06:01:58,367 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-25 06:01:58,368 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:59,224 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-25 06:01:59,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:01:59,247 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-25 06:01:59,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:01:59,253 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:01:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:01:59,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:01:59,286 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-25 06:01:59,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:59,300 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-25 06:01:59,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:01:59,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:01:59,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 06:01:59,334 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-25 06:01:59,335 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:01:59,953 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-25 06:01:59,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:01:59,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 32 [2018-01-25 06:01:59,955 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:01:59,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 06:01:59,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 06:01:59,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 06:01:59,957 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 19 states. [2018-01-25 06:02:00,274 WARN L143 SmtUtils]: Spent 127ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-25 06:02:00,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:00,654 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2018-01-25 06:02:00,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 06:02:00,654 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-01-25 06:02:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:00,655 INFO L225 Difference]: With dead ends: 135 [2018-01-25 06:02:00,655 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 06:02:00,656 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=209, Invalid=1431, Unknown=0, NotChecked=0, Total=1640 [2018-01-25 06:02:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 06:02:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-25 06:02:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 06:02:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-25 06:02:00,662 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 23 [2018-01-25 06:02:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:00,662 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-25 06:02:00,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-25 06:02:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-25 06:02:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 06:02:00,663 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:00,664 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:02:00,664 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:02:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash 376259064, now seen corresponding path program 1 times [2018-01-25 06:02:00,664 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:00,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:00,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:00,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:00,665 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:00,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-25 06:02:00,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:02:00,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:02:00,771 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:00,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 06:02:00,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 06:02:00,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:02:00,772 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-01-25 06:02:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:00,924 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-01-25 06:02:00,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:02:00,924 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-25 06:02:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:00,925 INFO L225 Difference]: With dead ends: 104 [2018-01-25 06:02:00,925 INFO L226 Difference]: Without dead ends: 103 [2018-01-25 06:02:00,926 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:02:00,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-25 06:02:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-01-25 06:02:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-25 06:02:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-01-25 06:02:00,934 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 38 [2018-01-25 06:02:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:00,935 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-01-25 06:02:00,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 06:02:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-01-25 06:02:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 06:02:00,936 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:00,936 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:02:00,936 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:02:00,936 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 1 times [2018-01-25 06:02:00,936 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:00,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:00,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:00,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:00,937 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:00,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:01,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:01,017 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:02:01,018 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-25 06:02:01,018 INFO L201 CegarAbsIntRunner]: [3], [7], [10], [28], [32], [37], [40], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [123], [124], [125], [127], [128], [129] [2018-01-25 06:02:01,020 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:02:01,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:02:01,490 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:02:01,490 INFO L268 AbstractInterpreter]: Visited 29 different actions 42 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-01-25 06:02:01,498 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:02:01,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:01,498 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-25 06:02:01,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:01,515 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:02:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:01,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:02:01,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:01,769 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:02:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:01,978 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:01,978 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-25 06:02:01,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:01,989 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:02:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:02,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:02:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-25 06:02:02,110 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:02:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-25 06:02:02,216 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-01-25 06:02:02,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7, 7, 7] total 18 [2018-01-25 06:02:02,217 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:02,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:02:02,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:02:02,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-01-25 06:02:02,218 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 4 states. [2018-01-25 06:02:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:02,292 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-01-25 06:02:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:02:02,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-25 06:02:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:02,298 INFO L225 Difference]: With dead ends: 137 [2018-01-25 06:02:02,298 INFO L226 Difference]: Without dead ends: 101 [2018-01-25 06:02:02,299 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-01-25 06:02:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-25 06:02:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2018-01-25 06:02:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-25 06:02:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-01-25 06:02:02,309 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 38 [2018-01-25 06:02:02,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:02,309 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-01-25 06:02:02,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:02:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-01-25 06:02:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 06:02:02,311 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:02,311 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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-25 06:02:02,311 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:02:02,311 INFO L82 PathProgramCache]: Analyzing trace with hash -435840666, now seen corresponding path program 1 times [2018-01-25 06:02:02,312 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:02,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:02,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:02,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:02,313 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:02,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-25 06:02:02,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:02:02,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:02:02,397 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:02,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:02:02,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:02:02,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:02:02,398 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 5 states. [2018-01-25 06:02:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:02,428 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2018-01-25 06:02:02,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:02:02,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-25 06:02:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:02,432 INFO L225 Difference]: With dead ends: 168 [2018-01-25 06:02:02,432 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 06:02:02,433 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-25 06:02:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 06:02:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2018-01-25 06:02:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 06:02:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-01-25 06:02:02,443 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 42 [2018-01-25 06:02:02,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:02,444 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-01-25 06:02:02,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:02:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-01-25 06:02:02,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-25 06:02:02,445 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:02,446 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:02:02,446 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:02:02,446 INFO L82 PathProgramCache]: Analyzing trace with hash 946633512, now seen corresponding path program 1 times [2018-01-25 06:02:02,446 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:02,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:02,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:02,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:02,447 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:02,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:02:02,552 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:02,552 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:02:02,552 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-25 06:02:02,553 INFO L201 CegarAbsIntRunner]: [3], [7], [12], [14], [19], [21], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [121], [122], [123], [124], [125], [127], [128], [129] [2018-01-25 06:02:02,554 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:02:02,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:02:03,139 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 06:02:03,139 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-25 06:02:03,141 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 06:02:03,594 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 79.59% of their original sizes. [2018-01-25 06:02:03,594 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 06:02:03,630 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 4 c_entry_point_~i~12) c_entry_point_~array~12.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| c_entry_point_~array~12.base) .cse3)) (.cse2 (select (select |c_#memory_$Pointer$.base| c_entry_point_~array~12.base) .cse3)) (.cse0 (select |c_#valid| 0))) (and (= c_entry_point_~array~12.offset .cse0) (= 0 .cse1) (forall ((v_weq0_3 Int) (v_weq1_3 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| v_weq0_3) v_weq1_3) (select (select |c_#memory_$Pointer$.base| v_weq0_3) v_weq1_3)) (not (= v_weq0_3 c_entry_point_~array~12.base)) (not (= v_weq1_3 (+ (* 4 c_entry_point_~i~12) c_entry_point_~array~12.offset))))) (= |c_#NULL.offset| |c_#NULL.base|) (= 1 (select |c_#valid| c_entry_point_~array~12.base)) (forall ((v_weq0_3 Int)) (or (not (= v_weq0_3 (+ (* 4 c_entry_point_~i~12) c_entry_point_~array~12.offset))) (= (select (select |c_#memory_$Pointer$.offset| c_entry_point_~array~12.base) v_weq0_3) (select (select |c_#memory_$Pointer$.base| c_entry_point_~array~12.base) v_weq0_3)))) (= c_entry_point_~len~12 10) (= .cse1 .cse2) (not (= 0 c_entry_point_~array~12.base)) (= .cse2 c_entry_point_~array~12.offset) (= .cse0 |c_#NULL.offset|)))) is different from false [2018-01-25 06:02:03,905 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 06:02:03,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:02:03,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [7] total 24 [2018-01-25 06:02:03,907 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:02:03,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 06:02:03,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 06:02:03,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=246, Unknown=1, NotChecked=32, Total=342 [2018-01-25 06:02:03,908 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 19 states. [2018-01-25 06:02:05,140 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 4 c_entry_point_~i~12) c_entry_point_~array~12.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| c_entry_point_~array~12.base) .cse3)) (.cse2 (select (select |c_#memory_$Pointer$.base| c_entry_point_~array~12.base) .cse3)) (.cse0 (select |c_#valid| 0))) (and (= c_entry_point_~array~12.offset .cse0) (= 0 .cse1) (forall ((v_weq0_3 Int) (v_weq1_3 Int)) (or (= (select (select |c_#memory_$Pointer$.offset| v_weq0_3) v_weq1_3) (select (select |c_#memory_$Pointer$.base| v_weq0_3) v_weq1_3)) (not (= v_weq0_3 c_entry_point_~array~12.base)) (not (= v_weq1_3 (+ (* 4 c_entry_point_~i~12) c_entry_point_~array~12.offset))))) (= |c_#NULL.offset| |c_#NULL.base|) (= 1 (select |c_#valid| c_entry_point_~array~12.base)) (forall ((v_weq0_3 Int)) (or (not (= v_weq0_3 (+ (* 4 c_entry_point_~i~12) c_entry_point_~array~12.offset))) (= (select (select |c_#memory_$Pointer$.offset| c_entry_point_~array~12.base) v_weq0_3) (select (select |c_#memory_$Pointer$.base| c_entry_point_~array~12.base) v_weq0_3)))) (= c_entry_point_~len~12 10) (= 0 c_entry_point_~array~12.offset) (= .cse1 .cse2) (not (= 0 c_entry_point_~array~12.base)) (= .cse2 c_entry_point_~array~12.offset) (= .cse0 |c_#NULL.offset|)))) is different from false [2018-01-25 06:02:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:08,273 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2018-01-25 06:02:08,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 06:02:08,273 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-01-25 06:02:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:08,275 INFO L225 Difference]: With dead ends: 159 [2018-01-25 06:02:08,275 INFO L226 Difference]: Without dead ends: 130 [2018-01-25 06:02:08,276 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=277, Unknown=2, NotChecked=70, Total=420 [2018-01-25 06:02:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-25 06:02:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2018-01-25 06:02:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-25 06:02:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2018-01-25 06:02:08,291 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 44 [2018-01-25 06:02:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:08,291 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2018-01-25 06:02:08,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-25 06:02:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-01-25 06:02:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-25 06:02:08,293 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:08,293 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:02:08,293 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:02:08,294 INFO L82 PathProgramCache]: Analyzing trace with hash 946633513, now seen corresponding path program 1 times [2018-01-25 06:02:08,294 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:08,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:08,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:08,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:08,295 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:08,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:02:08,390 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:08,391 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:02:08,391 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-25 06:02:08,391 INFO L201 CegarAbsIntRunner]: [3], [7], [12], [14], [19], [22], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [121], [122], [123], [124], [125], [127], [128], [129] [2018-01-25 06:02:08,393 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:02:08,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:02:08,820 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:02:08,821 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-25 06:02:08,822 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:02:08,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:08,822 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-25 06:02:08,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:08,831 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:02:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:08,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:02:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:08,961 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:02:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:02:09,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:09,105 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:02:09,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:09,109 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:02:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:09,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:02:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:09,155 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:02:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:02:09,174 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:02:09,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 16 [2018-01-25 06:02:09,175 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:02:09,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 06:02:09,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 06:02:09,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:02:09,176 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 11 states. [2018-01-25 06:02:09,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:09,265 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2018-01-25 06:02:09,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:02:09,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-01-25 06:02:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:09,267 INFO L225 Difference]: With dead ends: 202 [2018-01-25 06:02:09,267 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 06:02:09,267 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-01-25 06:02:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 06:02:09,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-01-25 06:02:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-25 06:02:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2018-01-25 06:02:09,277 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 44 [2018-01-25 06:02:09,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:09,277 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-01-25 06:02:09,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 06:02:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2018-01-25 06:02:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-25 06:02:09,278 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:09,278 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:02:09,278 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:02:09,279 INFO L82 PathProgramCache]: Analyzing trace with hash -108654542, now seen corresponding path program 2 times [2018-01-25 06:02:09,279 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:09,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:09,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:02:09,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:09,280 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:09,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:02:09,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:09,432 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:02:09,432 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:02:09,432 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:02:09,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:09,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:02:09,445 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:02:09,445 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:02:09,458 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:02:09,472 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:02:09,483 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:02:09,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:02:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:09,704 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:02:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:02:09,777 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:09,777 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:02:09,780 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 06:02:09,781 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 06:02:09,793 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:02:09,811 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 06:02:09,826 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:02:09,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:02:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:02:09,838 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:02:09,849 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:02:09,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:02:09,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 19 [2018-01-25 06:02:09,851 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:02:09,851 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 06:02:09,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 06:02:09,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2018-01-25 06:02:09,852 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 13 states. [2018-01-25 06:02:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:02:09,909 INFO L93 Difference]: Finished difference Result 206 states and 227 transitions. [2018-01-25 06:02:09,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:02:09,910 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-01-25 06:02:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:02:09,911 INFO L225 Difference]: With dead ends: 206 [2018-01-25 06:02:09,911 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 06:02:09,912 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2018-01-25 06:02:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 06:02:09,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-01-25 06:02:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-25 06:02:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2018-01-25 06:02:09,923 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 48 [2018-01-25 06:02:09,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:02:09,924 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2018-01-25 06:02:09,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 06:02:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2018-01-25 06:02:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-25 06:02:09,925 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:02:09,925 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:02:09,925 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 06:02:09,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1169426245, now seen corresponding path program 3 times [2018-01-25 06:02:09,925 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:02:09,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:09,926 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 06:02:09,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:02:09,927 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:02:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:02:09,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:02:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 06:02:10,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:10,038 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:02:10,038 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 06:02:10,038 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:02:10,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:10,039 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:02:10,052 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 06:02:10,052 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 06:02:10,067 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:02:10,076 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:02:10,080 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:02:10,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:02:10,103 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 26 treesize of output 25 [2018-01-25 06:02:10,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:10,137 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 25 treesize of output 24 [2018-01-25 06:02:10,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:10,139 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 23 treesize of output 22 [2018-01-25 06:02:10,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:10,156 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 22 treesize of output 21 [2018-01-25 06:02:10,156 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:10,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:02:10,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 06:02:10,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:02:10,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:02:10,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-25 06:02:10,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:10,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:02:10,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-01-25 06:02:10,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:10,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:02:10,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-01-25 06:02:10,397 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:10,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:02:10,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:02:10,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-25 06:02:10,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:10,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-25 06:02:10,436 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-25 06:02:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-25 06:02:10,506 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:02:10,621 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-25 06:02:17,340 WARN L146 SmtUtils]: Spent 6607ms on a formula simplification. DAG size of input: 80 DAG size of output 31 [2018-01-25 06:02:17,351 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:02:20,671 WARN L146 SmtUtils]: Spent 3233ms on a formula simplification. DAG size of input: 73 DAG size of output 41 [2018-01-25 06:02:20,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-25 06:02:20,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:20,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-25 06:02:20,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:21,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-01-25 06:02:21,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-25 06:02:21,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:21,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:02:21,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:02:21,044 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 06:02:25,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-25 06:02:25,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:25,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-25 06:02:25,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:25,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-25 06:02:25,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-25 06:02:25,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:25,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:02:25,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:02:25,724 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 06:02:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-25 06:02:25,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:02:25,867 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 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 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:02:25,870 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 06:02:25,870 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 06:02:25,885 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:02:25,900 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 06:02:25,917 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 06:02:25,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:02:25,931 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 23 treesize of output 22 [2018-01-25 06:02:25,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:25,956 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 22 treesize of output 21 [2018-01-25 06:02:25,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:25,962 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 26 treesize of output 25 [2018-01-25 06:02:25,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:25,980 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 25 treesize of output 24 [2018-01-25 06:02:25,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:25,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:02:25,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 06:02:26,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:02:26,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:02:26,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-25 06:02:26,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:26,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:02:26,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-01-25 06:02:26,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:26,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:02:26,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:02:26,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-25 06:02:26,090 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:26,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:02:26,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-01-25 06:02:26,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:26,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-25 06:02:26,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-01-25 06:02:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-25 06:02:26,141 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:02:26,243 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-25 06:02:30,663 WARN L146 SmtUtils]: Spent 2194ms on a formula simplification. DAG size of input: 80 DAG size of output 31 [2018-01-25 06:02:30,671 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:02:38,864 WARN L143 SmtUtils]: Spent 4028ms on a formula simplification that was a NOOP. DAG size: 73 [2018-01-25 06:02:38,869 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:02:38,881 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:02:39,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-25 06:02:39,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:39,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-25 06:02:39,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:39,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-01-25 06:02:39,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-25 06:02:39,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:39,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:02:39,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:02:39,071 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-25 06:02:39,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-25 06:02:39,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:39,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-25 06:02:39,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:39,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-25 06:02:39,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-25 06:02:39,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:02:39,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:02:39,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-25 06:02:39,769 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-25 06:02:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-01-25 06:02:39,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:02:39,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12, 12, 12] total 33 [2018-01-25 06:02:39,898 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:02:39,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 06:02:39,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 06:02:39,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=955, Unknown=7, NotChecked=0, Total=1056 [2018-01-25 06:02:39,899 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 20 states. Received shutdown request... [2018-01-25 06:02:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 06:02:50,136 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:02:50,141 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:02:50,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:02:50 BoogieIcfgContainer [2018-01-25 06:02:50,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:02:50,142 INFO L168 Benchmark]: Toolchain (without parser) took 55632.84 ms. Allocated memory was 302.0 MB in the beginning and 793.2 MB in the end (delta: 491.3 MB). Free memory was 260.9 MB in the beginning and 411.0 MB in the end (delta: -150.1 MB). Peak memory consumption was 341.2 MB. Max. memory is 5.3 GB. [2018-01-25 06:02:50,143 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:02:50,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.15 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 247.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:02:50,143 INFO L168 Benchmark]: Boogie Preprocessor took 43.42 ms. Allocated memory is still 302.0 MB. Free memory was 247.0 MB in the beginning and 246.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-25 06:02:50,143 INFO L168 Benchmark]: RCFGBuilder took 326.66 ms. Allocated memory is still 302.0 MB. Free memory was 246.0 MB in the beginning and 223.7 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. [2018-01-25 06:02:50,144 INFO L168 Benchmark]: TraceAbstraction took 55026.33 ms. Allocated memory was 302.0 MB in the beginning and 793.2 MB in the end (delta: 491.3 MB). Free memory was 223.7 MB in the beginning and 411.0 MB in the end (delta: -187.3 MB). Peak memory consumption was 304.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:02:50,146 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.22 ms. Allocated memory is still 302.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 227.15 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 247.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.42 ms. Allocated memory is still 302.0 MB. Free memory was 247.0 MB in the beginning and 246.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 326.66 ms. Allocated memory is still 302.0 MB. Free memory was 246.0 MB in the beginning and 223.7 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55026.33 ms. Allocated memory was 302.0 MB in the beginning and 793.2 MB in the end (delta: 491.3 MB). Free memory was 223.7 MB in the beginning and 411.0 MB in the end (delta: -187.3 MB). Peak memory consumption was 304.0 MB. 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) : 2.914239 RENAME_VARIABLES(MILLISECONDS) : 1.495576 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.859883 PROJECTAWAY(MILLISECONDS) : 1.225749 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.160578 DISJOIN(MILLISECONDS) : 1.693501 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.533414 ADD_EQUALITY(MILLISECONDS) : 0.038143 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011861 #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 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 241 LocStat_NO_SUPPORTING_DISEQUALITIES : 21 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 39 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.486333 RENAME_VARIABLES(MILLISECONDS) : 0.077895 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.204460 PROJECTAWAY(MILLISECONDS) : 0.034279 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.091142 DISJOIN(MILLISECONDS) : 0.172166 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.095032 ADD_EQUALITY(MILLISECONDS) : 0.022219 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008586 #CONJOIN_DISJUNCTIVE : 62 #RENAME_VARIABLES : 105 #UNFREEZE : 0 #CONJOIN : 113 #PROJECTAWAY : 95 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 102 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 215 LocStat_NO_SUPPORTING_DISEQUALITIES : 26 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 40 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.583484 RENAME_VARIABLES(MILLISECONDS) : 0.154817 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.541212 PROJECTAWAY(MILLISECONDS) : 0.087294 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.071641 DISJOIN(MILLISECONDS) : 8.042752 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.183510 ADD_EQUALITY(MILLISECONDS) : 0.018302 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020599 #CONJOIN_DISJUNCTIVE : 76 #RENAME_VARIABLES : 139 #UNFREEZE : 0 #CONJOIN : 139 #PROJECTAWAY : 114 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 19 #RENAME_VARIABLES_DISJUNCTIVE : 136 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 227 LocStat_NO_SUPPORTING_DISEQUALITIES : 29 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 40 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 71 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 43 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.437694 RENAME_VARIABLES(MILLISECONDS) : 0.078237 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.198204 PROJECTAWAY(MILLISECONDS) : 0.039417 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.057986 DISJOIN(MILLISECONDS) : 0.589519 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.098666 ADD_EQUALITY(MILLISECONDS) : 0.018367 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007677 #CONJOIN_DISJUNCTIVE : 76 #RENAME_VARIABLES : 141 #UNFREEZE : 0 #CONJOIN : 141 #PROJECTAWAY : 119 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 22 #RENAME_VARIABLES_DISJUNCTIVE : 136 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was constructing difference of abstraction (118states) and interpolant automaton (currently 17 states, 20 states before enhancement), while ReachableStatesComputation was computing reachable states (84 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 15 error locations. TIMEOUT Result, 54.9s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 16.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 843 SDtfs, 471 SDslu, 3267 SDs, 0 SdLazy, 1043 SolverSat, 118 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 972 GetRequests, 767 SyntacticMatches, 17 SemanticMatches, 188 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 35.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.91791944185925 AbsIntWeakeningRatio, 0.8837209302325582 AbsIntAvgWeakeningVarsNumRemoved, 5.255813953488372 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 116 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 34.3s InterpolantComputationTime, 830 NumberOfCodeBlocks, 790 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1207 ConstructedInterpolants, 102 QuantifiedInterpolants, 441408 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1382 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 33 InterpolantComputations, 9 PerfectInterpolantSequences, 354/759 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_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-02-50-157.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-02-50-157.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-02-50-157.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-02-50-157.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-02-50-157.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_06-02-50-157.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_06-02-50-157.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_06-02-50-157.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_06-02-50-157.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-02-50-157.csv Completed graceful shutdown