java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:41:18,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:41:18,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:41:18,140 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:41:18,140 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:41:18,141 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:41:18,142 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:41:18,144 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:41:18,146 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:41:18,147 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:41:18,148 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:41:18,148 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:41:18,149 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:41:18,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:41:18,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:41:18,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:41:18,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:41:18,158 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:41:18,160 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:41:18,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:41:18,163 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:41:18,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:41:18,164 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:41:18,165 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:41:18,166 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:41:18,167 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:41:18,168 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:41:18,168 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:41:18,169 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:41:18,169 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:41:18,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:41:18,170 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 16:41:18,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:41:18,179 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:41:18,179 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:41:18,179 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:41:18,179 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:41:18,180 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:41:18,180 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:41:18,180 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:41:18,180 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:41:18,180 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:41:18,181 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:41:18,181 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:41:18,181 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:41:18,181 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:41:18,181 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:41:18,181 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:41:18,181 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:41:18,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:41:18,182 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:41:18,182 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:41:18,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:41:18,182 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:41:18,182 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:41:18,183 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:41:18,183 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:41:18,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:41:18,183 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:41:18,183 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:41:18,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:41:18,184 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:41:18,184 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:41:18,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:41:18,184 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:41:18,184 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:41:18,185 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:41:18,185 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:41:18,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:41:18,230 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:41:18,233 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:41:18,235 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:41:18,235 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:41:18,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:41:18,386 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:41:18,390 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:41:18,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:41:18,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:41:18,421 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:41:18,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:41:18" (1/1) ... [2018-01-24 16:41:18,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1365a45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:18, skipping insertion in model container [2018-01-24 16:41:18,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:41:18" (1/1) ... [2018-01-24 16:41:18,440 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:41:18,479 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:41:18,592 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:41:18,607 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:41:18,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:18 WrapperNode [2018-01-24 16:41:18,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:41:18,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:41:18,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:41:18,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:41:18,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:18" (1/1) ... [2018-01-24 16:41:18,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:18" (1/1) ... [2018-01-24 16:41:18,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:18" (1/1) ... [2018-01-24 16:41:18,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:18" (1/1) ... [2018-01-24 16:41:18,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:18" (1/1) ... [2018-01-24 16:41:18,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:18" (1/1) ... [2018-01-24 16:41:18,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:18" (1/1) ... [2018-01-24 16:41:18,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:41:18,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:41:18,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:41:18,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:41:18,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:18" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:41:18,710 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:41:18,711 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:41:18,711 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-24 16:41:18,711 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:41:18,711 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:41:18,711 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:41:18,711 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:41:18,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:41:18,712 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:41:18,712 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:41:18,712 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-24 16:41:18,712 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:41:18,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:41:18,713 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:41:18,952 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:41:18,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:41:18 BoogieIcfgContainer [2018-01-24 16:41:18,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:41:18,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:41:18,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:41:18,955 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:41:18,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:41:18" (1/3) ... [2018-01-24 16:41:18,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4357a858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:41:18, skipping insertion in model container [2018-01-24 16:41:18,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:41:18" (2/3) ... [2018-01-24 16:41:18,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4357a858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:41:18, skipping insertion in model container [2018-01-24 16:41:18,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:41:18" (3/3) ... [2018-01-24 16:41:18,958 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:41:18,965 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:41:18,972 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 16:41:19,015 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:41:19,016 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:41:19,016 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:41:19,016 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:41:19,016 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:41:19,016 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:41:19,016 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:41:19,016 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:41:19,017 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:41:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-24 16:41:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:41:19,042 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:19,043 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:19,043 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:19,047 INFO L82 PathProgramCache]: Analyzing trace with hash 286131230, now seen corresponding path program 1 times [2018-01-24 16:41:19,048 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:19,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:19,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:19,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:19,090 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:19,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:19,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:19,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:41:19,302 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:19,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:41:19,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:41:19,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:41:19,382 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-01-24 16:41:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:19,510 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-24 16:41:19,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:41:19,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 16:41:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:19,523 INFO L225 Difference]: With dead ends: 78 [2018-01-24 16:41:19,523 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 16:41:19,527 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:41:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 16:41:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 16:41:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 16:41:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-24 16:41:19,555 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 13 [2018-01-24 16:41:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:19,556 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-24 16:41:19,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:41:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-24 16:41:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:41:19,556 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:19,557 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:19,557 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash 286131231, now seen corresponding path program 1 times [2018-01-24 16:41:19,557 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:19,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:19,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:19,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:19,558 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:19,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:19,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:19,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:41:19,725 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:19,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:41:19,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:41:19,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:41:19,727 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-01-24 16:41:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:19,820 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-01-24 16:41:19,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:41:19,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 16:41:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:19,821 INFO L225 Difference]: With dead ends: 52 [2018-01-24 16:41:19,822 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 16:41:19,823 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:41:19,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 16:41:19,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 16:41:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 16:41:19,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-24 16:41:19,831 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 13 [2018-01-24 16:41:19,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:19,831 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-24 16:41:19,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:41:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-24 16:41:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:41:19,832 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:19,832 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:19,832 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash 280133580, now seen corresponding path program 1 times [2018-01-24 16:41:19,833 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:19,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:19,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:19,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:19,834 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:19,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:19,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:19,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:41:19,873 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:19,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:41:19,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:41:19,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:41:19,873 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 4 states. [2018-01-24 16:41:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:19,990 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-01-24 16:41:19,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:41:19,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 16:41:19,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:19,992 INFO L225 Difference]: With dead ends: 51 [2018-01-24 16:41:19,992 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 16:41:19,992 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:41:19,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 16:41:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 16:41:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 16:41:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-24 16:41:20,000 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 14 [2018-01-24 16:41:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:20,000 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-24 16:41:20,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:41:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-24 16:41:20,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:41:20,001 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:20,001 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:20,001 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:20,002 INFO L82 PathProgramCache]: Analyzing trace with hash 280133581, now seen corresponding path program 1 times [2018-01-24 16:41:20,002 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:20,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:20,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,003 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:20,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:20,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:20,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:41:20,089 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:20,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:41:20,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:41:20,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:41:20,090 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-01-24 16:41:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:20,123 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-24 16:41:20,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:41:20,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:41:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:20,125 INFO L225 Difference]: With dead ends: 50 [2018-01-24 16:41:20,125 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 16:41:20,125 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:41:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 16:41:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 16:41:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 16:41:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 16:41:20,132 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 14 [2018-01-24 16:41:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:20,133 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 16:41:20,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:41:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 16:41:20,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:41:20,133 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:20,133 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:20,134 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1890531033, now seen corresponding path program 1 times [2018-01-24 16:41:20,134 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:20,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:20,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,135 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:20,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:20,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:20,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:20,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:41:20,195 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:20,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:41:20,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:41:20,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:41:20,195 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2018-01-24 16:41:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:20,268 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-24 16:41:20,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:41:20,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 16:41:20,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:20,270 INFO L225 Difference]: With dead ends: 49 [2018-01-24 16:41:20,270 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 16:41:20,271 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:41:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 16:41:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 16:41:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 16:41:20,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 16:41:20,277 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2018-01-24 16:41:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:20,278 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 16:41:20,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:41:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 16:41:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:41:20,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:20,279 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:20,279 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1890531034, now seen corresponding path program 1 times [2018-01-24 16:41:20,280 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:20,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:20,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,281 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:20,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:20,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:20,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:41:20,398 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:20,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:41:20,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:41:20,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:41:20,399 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 8 states. [2018-01-24 16:41:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:20,500 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-01-24 16:41:20,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 16:41:20,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 16:41:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:20,504 INFO L225 Difference]: With dead ends: 69 [2018-01-24 16:41:20,504 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 16:41:20,504 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:41:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 16:41:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2018-01-24 16:41:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:41:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-24 16:41:20,509 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 18 [2018-01-24 16:41:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:20,510 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-24 16:41:20,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:41:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-24 16:41:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:41:20,510 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:20,510 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:20,510 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:20,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2045951649, now seen corresponding path program 1 times [2018-01-24 16:41:20,511 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:20,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:20,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,512 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:20,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:20,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:20,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:41:20,561 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:20,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:41:20,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:41:20,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:41:20,562 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 5 states. [2018-01-24 16:41:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:20,644 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-01-24 16:41:20,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 16:41:20,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 16:41:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:20,645 INFO L225 Difference]: With dead ends: 55 [2018-01-24 16:41:20,645 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 16:41:20,646 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:41:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 16:41:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 16:41:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 16:41:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-01-24 16:41:20,652 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 22 [2018-01-24 16:41:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:20,652 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-01-24 16:41:20,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:41:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-01-24 16:41:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 16:41:20,653 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:20,653 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:20,653 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:20,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2045951648, now seen corresponding path program 1 times [2018-01-24 16:41:20,654 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:20,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:20,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,655 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:20,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:20,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:20,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 16:41:20,809 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:20,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 16:41:20,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 16:41:20,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:41:20,810 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2018-01-24 16:41:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:20,900 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-01-24 16:41:20,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:41:20,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 16:41:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:20,901 INFO L225 Difference]: With dead ends: 62 [2018-01-24 16:41:20,901 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 16:41:20,901 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:41:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 16:41:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-01-24 16:41:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:41:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-24 16:41:20,907 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2018-01-24 16:41:20,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:20,908 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-24 16:41:20,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 16:41:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-24 16:41:20,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 16:41:20,909 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:20,909 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:20,909 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:20,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1000289501, now seen corresponding path program 1 times [2018-01-24 16:41:20,910 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:20,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:20,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,910 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:20,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:20,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:20,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:41:20,945 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:20,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 16:41:20,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 16:41:20,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:41:20,946 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 3 states. [2018-01-24 16:41:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:20,952 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-01-24 16:41:20,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 16:41:20,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-24 16:41:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:20,953 INFO L225 Difference]: With dead ends: 85 [2018-01-24 16:41:20,953 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 16:41:20,954 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 16:41:20,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 16:41:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-24 16:41:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 16:41:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-01-24 16:41:20,960 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 23 [2018-01-24 16:41:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:20,960 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-01-24 16:41:20,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 16:41:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-01-24 16:41:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:41:20,961 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:20,961 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 16:41:20,962 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:20,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1354456010, now seen corresponding path program 1 times [2018-01-24 16:41:20,962 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:20,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:20,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:20,963 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:20,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:21,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:41:21,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 16:41:21,180 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:21,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 16:41:21,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 16:41:21,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-24 16:41:21,181 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 12 states. [2018-01-24 16:41:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:21,532 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-01-24 16:41:21,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:41:21,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-01-24 16:41:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:21,533 INFO L225 Difference]: With dead ends: 122 [2018-01-24 16:41:21,533 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 16:41:21,534 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-01-24 16:41:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 16:41:21,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-01-24 16:41:21,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 16:41:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-01-24 16:41:21,544 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 26 [2018-01-24 16:41:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:21,544 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-01-24 16:41:21,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 16:41:21,544 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-01-24 16:41:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:41:21,545 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:21,546 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 16:41:21,546 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:21,546 INFO L82 PathProgramCache]: Analyzing trace with hash 536807560, now seen corresponding path program 1 times [2018-01-24 16:41:21,546 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:21,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:21,547 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:21,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:21,548 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:21,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:21,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:21,782 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:41:21,782 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 16:41:21,784 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [14], [15], [18], [21], [29], [52], [57], [61], [65], [66], [67], [68], [69], [72], [83], [84], [85], [87] [2018-01-24 16:41:21,828 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:41:21,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:41:22,099 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:41:22,100 INFO L268 AbstractInterpreter]: Visited 25 different actions 43 times. Merged at 9 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 16:41:22,117 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:41:22,117 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:22,117 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:41:22,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:22,136 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:41:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:22,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:22,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 16:41:22,251 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 8 treesize of output 7 [2018-01-24 16:41:22,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:22,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:22,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:22,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 16:41:22,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-01-24 16:41:22,435 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 26 treesize of output 19 [2018-01-24 16:41:22,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:22,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 12 [2018-01-24 16:41:22,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:22,481 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 22 treesize of output 12 [2018-01-24 16:41:22,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:22,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:22,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:22,503 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:30, output treesize:8 [2018-01-24 16:41:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:22,543 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:22,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:41:22,681 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:41:22,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:22,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:22,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:22,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-24 16:41:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:22,734 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:41:22,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [13] total 29 [2018-01-24 16:41:22,734 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:41:22,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 16:41:22,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 16:41:22,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2018-01-24 16:41:22,735 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 12 states. [2018-01-24 16:41:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:23,159 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2018-01-24 16:41:23,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 16:41:23,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-01-24 16:41:23,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:23,160 INFO L225 Difference]: With dead ends: 169 [2018-01-24 16:41:23,161 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 16:41:23,161 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 16:41:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 16:41:23,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 103. [2018-01-24 16:41:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 16:41:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-01-24 16:41:23,169 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 26 [2018-01-24 16:41:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:23,169 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-01-24 16:41:23,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 16:41:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-01-24 16:41:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:41:23,170 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:23,170 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 16:41:23,170 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1152136182, now seen corresponding path program 1 times [2018-01-24 16:41:23,170 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:23,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:23,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:23,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:23,171 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:23,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:23,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:23,426 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:41:23,427 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 16:41:23,427 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [14], [15], [18], [21], [29], [52], [57], [63], [65], [66], [67], [68], [69], [72], [83], [84], [85], [87] [2018-01-24 16:41:23,428 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:41:23,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:41:23,619 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:41:23,619 INFO L268 AbstractInterpreter]: Visited 25 different actions 43 times. Merged at 9 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 16:41:23,625 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:41:23,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:23,626 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:41:23,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:23,638 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:41:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:23,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:23,674 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 6 treesize of output 5 [2018-01-24 16:41:23,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:23,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:23,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:41:23,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:23,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:23,719 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 11 treesize of output 4 [2018-01-24 16:41:23,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:23,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:23,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 16:41:23,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 14 treesize of output 11 [2018-01-24 16:41:23,810 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 11 treesize of output 10 [2018-01-24 16:41:23,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:23,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:23,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:41:23,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 16:41:23,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-24 16:41:23,866 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 11 treesize of output 10 [2018-01-24 16:41:23,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:23,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:23,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 16:41:23,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 16:41:24,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-01-24 16:41:24,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 16:41:24,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:24,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 8 treesize of output 1 [2018-01-24 16:41:24,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:24,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:24,068 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-01-24 16:41:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:24,212 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:24,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 16:41:24,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:41:24,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:41:24,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,489 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,494 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-24 16:41:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:24,542 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:24,542 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 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 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:41:24,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:24,546 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:41:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:24,587 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:24,590 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 6 treesize of output 5 [2018-01-24 16:41:24,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,594 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 6 treesize of output 5 [2018-01-24 16:41:24,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:41:24,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:24,667 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 12 treesize of output 15 [2018-01-24 16:41:24,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:24,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:24,682 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 11 treesize of output 4 [2018-01-24 16:41:24,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 16:41:24,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 13 [2018-01-24 16:41:24,764 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 13 treesize of output 12 [2018-01-24 16:41:24,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 16:41:24,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 16:41:24,846 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 13 treesize of output 12 [2018-01-24 16:41:24,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:24,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 16:41:24,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 16:41:24,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-01-24 16:41:24,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2018-01-24 16:41:24,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:25,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 1 [2018-01-24 16:41:25,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:25,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:25,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:25,008 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:35 [2018-01-24 16:41:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:25,137 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:25,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:41:25,329 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:41:25,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:25,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:25,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:25,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 16:41:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:25,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:41:25,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 10, 13, 11] total 49 [2018-01-24 16:41:25,471 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:41:25,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 16:41:25,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 16:41:25,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2264, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 16:41:25,473 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 25 states. [2018-01-24 16:41:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:26,813 INFO L93 Difference]: Finished difference Result 147 states and 163 transitions. [2018-01-24 16:41:26,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 16:41:26,814 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2018-01-24 16:41:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:26,816 INFO L225 Difference]: With dead ends: 147 [2018-01-24 16:41:26,816 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 16:41:26,817 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=390, Invalid=3642, Unknown=0, NotChecked=0, Total=4032 [2018-01-24 16:41:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 16:41:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 113. [2018-01-24 16:41:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 16:41:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-01-24 16:41:26,837 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 26 [2018-01-24 16:41:26,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:26,838 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-01-24 16:41:26,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 16:41:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-01-24 16:41:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 16:41:26,839 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:26,839 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 16:41:26,839 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:26,840 INFO L82 PathProgramCache]: Analyzing trace with hash 352566928, now seen corresponding path program 1 times [2018-01-24 16:41:26,840 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:26,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:26,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:26,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:26,841 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:26,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:27,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:27,207 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:41:27,207 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-24 16:41:27,207 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [11], [14], [15], [18], [20], [21], [29], [52], [57], [63], [65], [66], [67], [68], [69], [72], [83], [84], [85], [87] [2018-01-24 16:41:27,208 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:41:27,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:41:27,355 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:41:27,355 INFO L268 AbstractInterpreter]: Visited 25 different actions 43 times. Merged at 9 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 16:41:27,366 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:41:27,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:27,366 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:41:27,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:27,377 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:41:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:27,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:27,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 16:41:27,414 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 11 treesize of output 10 [2018-01-24 16:41:27,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:27,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:27,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:41:27,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:41:27,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-01-24 16:41:27,755 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 29 treesize of output 22 [2018-01-24 16:41:27,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:27,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2018-01-24 16:41:27,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:27,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2018-01-24 16:41:27,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-01-24 16:41:27,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-24 16:41:28,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 16:41:28,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:66 [2018-01-24 16:41:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:28,144 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:28,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 16:41:28,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-24 16:41:28,588 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 24 treesize of output 16 [2018-01-24 16:41:28,589 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,609 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-24 16:41:28,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,622 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-01-24 16:41:28,622 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,625 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,635 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-01-24 16:41:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:28,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:28,662 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 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 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:41:28,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:28,667 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:41:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:28,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:28,733 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 6 treesize of output 5 [2018-01-24 16:41:28,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 16:41:28,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:41:28,797 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 13 treesize of output 12 [2018-01-24 16:41:28,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:28,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 16:41:29,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-01-24 16:41:29,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2018-01-24 16:41:29,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:29,117 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 19 treesize of output 12 [2018-01-24 16:41:29,117 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,118 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 24 treesize of output 17 [2018-01-24 16:41:29,118 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2018-01-24 16:41:29,147 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-01-24 16:41:29,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-24 16:41:29,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 16:41:29,202 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:62 [2018-01-24 16:41:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:29,345 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:29,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-24 16:41:29,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-24 16:41:29,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:29,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:14 [2018-01-24 16:41:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:29,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:41:29,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12, 14, 14] total 49 [2018-01-24 16:41:29,614 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:41:29,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 16:41:29,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 16:41:29,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2237, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 16:41:29,616 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 24 states. [2018-01-24 16:41:30,447 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 80 DAG size of output 52 [2018-01-24 16:41:30,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:41:30,912 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-01-24 16:41:30,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 16:41:30,912 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-01-24 16:41:30,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:41:30,914 INFO L225 Difference]: With dead ends: 144 [2018-01-24 16:41:30,914 INFO L226 Difference]: Without dead ends: 142 [2018-01-24 16:41:30,915 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=471, Invalid=3689, Unknown=0, NotChecked=0, Total=4160 [2018-01-24 16:41:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-24 16:41:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2018-01-24 16:41:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-24 16:41:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-01-24 16:41:30,927 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 30 [2018-01-24 16:41:30,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:41:30,928 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-01-24 16:41:30,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 16:41:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-01-24 16:41:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:41:30,929 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:41:30,929 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:41:30,929 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 16:41:30,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1490010362, now seen corresponding path program 2 times [2018-01-24 16:41:30,930 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:41:30,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:30,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:41:30,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:41:30,931 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:41:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:41:30,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:41:31,277 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 22 DAG size of output 16 [2018-01-24 16:41:31,396 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 21 DAG size of output 16 [2018-01-24 16:41:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:31,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:31,700 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:41:31,701 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:41:31,701 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:41:31,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:31,701 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:41:31,716 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:41:31,716 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:41:31,730 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:31,737 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:31,739 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:41:31,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:31,760 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 6 treesize of output 5 [2018-01-24 16:41:31,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:31,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:31,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 16:41:31,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:31,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:31,797 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 11 treesize of output 4 [2018-01-24 16:41:31,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:31,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:31,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-24 16:41:31,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 14 treesize of output 11 [2018-01-24 16:41:31,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 16:41:31,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:31,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:31,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:41:31,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-24 16:41:31,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-24 16:41:31,875 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 11 treesize of output 10 [2018-01-24 16:41:31,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:31,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:31,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 16:41:31,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:38 [2018-01-24 16:41:32,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-24 16:41:32,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:32,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2018-01-24 16:41:32,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:32,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 8 treesize of output 1 [2018-01-24 16:41:32,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:32,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:32,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:32,605 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:57, output treesize:43 [2018-01-24 16:41:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:32,703 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:33,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-01-24 16:41:33,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2018-01-24 16:41:33,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-01-24 16:41:33,180 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:33,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:41:33,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-01-24 16:41:33,210 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:41:33,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:41:33,212 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,215 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:33,224 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:87, output treesize:23 [2018-01-24 16:41:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:33,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:41:33,449 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 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 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:41:33,452 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:41:33,452 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:41:33,466 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:33,487 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:41:33,519 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:41:33,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:41:33,526 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 6 treesize of output 5 [2018-01-24 16:41:33,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,531 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 6 treesize of output 5 [2018-01-24 16:41:33,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:41:33,573 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:33,574 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 12 treesize of output 15 [2018-01-24 16:41:33,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:33,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:41:33,582 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 11 treesize of output 4 [2018-01-24 16:41:33,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 16:41:33,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 13 [2018-01-24 16:41:33,659 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 13 treesize of output 12 [2018-01-24 16:41:33,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 16:41:33,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 16:41:33,720 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 13 treesize of output 12 [2018-01-24 16:41:33,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 16:41:33,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 16:41:33,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 16:41:33,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 1 [2018-01-24 16:41:33,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:33,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 16:41:33,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:41:33,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:33,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:33,975 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:34 [2018-01-24 16:41:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:34,015 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:41:34,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 16:41:34,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:41:34,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:41:34,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:41:34,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:41:34,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:52 [2018-01-24 16:41:34,857 WARN L143 SmtUtils]: Spent 308ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-24 16:41:35,103 WARN L143 SmtUtils]: Spent 160ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-24 16:41:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:41:35,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:41:35,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 16, 14, 12] total 57 [2018-01-24 16:41:35,118 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:41:35,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-24 16:41:35,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-24 16:41:35,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3095, Unknown=1, NotChecked=0, Total=3306 [2018-01-24 16:41:35,120 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 29 states. [2018-01-24 16:41:38,653 WARN L146 SmtUtils]: Spent 2896ms on a formula simplification. DAG size of input: 60 DAG size of output 54 [2018-01-24 16:41:38,916 WARN L146 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-01-24 16:41:39,734 WARN L146 SmtUtils]: Spent 757ms on a formula simplification. DAG size of input: 70 DAG size of output 64 [2018-01-24 16:41:40,396 WARN L146 SmtUtils]: Spent 601ms on a formula simplification. DAG size of input: 70 DAG size of output 56 [2018-01-24 16:41:43,754 WARN L146 SmtUtils]: Spent 3183ms on a formula simplification. DAG size of input: 65 DAG size of output 54 [2018-01-24 16:41:46,592 WARN L146 SmtUtils]: Spent 2736ms on a formula simplification. DAG size of input: 63 DAG size of output 52 [2018-01-24 16:41:53,978 WARN L146 SmtUtils]: Spent 7306ms on a formula simplification. DAG size of input: 78 DAG size of output 67 [2018-01-24 16:42:02,612 WARN L146 SmtUtils]: Spent 8556ms on a formula simplification. DAG size of input: 83 DAG size of output 70 [2018-01-24 16:42:13,005 WARN L146 SmtUtils]: Spent 10317ms on a formula simplification. DAG size of input: 94 DAG size of output 77 [2018-01-24 16:42:21,222 WARN L146 SmtUtils]: Spent 8153ms on a formula simplification. DAG size of input: 80 DAG size of output 68 Received shutdown request... [2018-01-24 16:42:25,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 16:42:25,328 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:42:25,331 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:42:25,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:42:25 BoogieIcfgContainer [2018-01-24 16:42:25,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:42:25,332 INFO L168 Benchmark]: Toolchain (without parser) took 66945.86 ms. Allocated memory was 307.2 MB in the beginning and 639.1 MB in the end (delta: 331.9 MB). Free memory was 267.3 MB in the beginning and 556.4 MB in the end (delta: -289.1 MB). Peak memory consumption was 42.8 MB. Max. memory is 5.3 GB. [2018-01-24 16:42:25,333 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 307.2 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:42:25,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.77 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-24 16:42:25,333 INFO L168 Benchmark]: Boogie Preprocessor took 41.70 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:42:25,334 INFO L168 Benchmark]: RCFGBuilder took 297.49 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 235.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:42:25,334 INFO L168 Benchmark]: TraceAbstraction took 66378.48 ms. Allocated memory was 307.2 MB in the beginning and 639.1 MB in the end (delta: 331.9 MB). Free memory was 235.4 MB in the beginning and 556.4 MB in the end (delta: -320.9 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:42:25,336 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.12 ms. Allocated memory is still 307.2 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 196.77 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.70 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 297.49 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 235.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 66378.48 ms. Allocated memory was 307.2 MB in the beginning and 639.1 MB in the end (delta: 331.9 MB). Free memory was 235.4 MB in the beginning and 556.4 MB in the end (delta: -320.9 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 242 LocStat_NO_SUPPORTING_DISEQUALITIES : 48 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 63 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.446328 RENAME_VARIABLES(MILLISECONDS) : 0.321946 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.410080 PROJECTAWAY(MILLISECONDS) : 0.896250 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001090 DISJOIN(MILLISECONDS) : 0.306709 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.347132 ADD_EQUALITY(MILLISECONDS) : 0.031141 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019145 #CONJOIN_DISJUNCTIVE : 79 #RENAME_VARIABLES : 133 #UNFREEZE : 0 #CONJOIN : 135 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 65 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 232 LocStat_NO_SUPPORTING_DISEQUALITIES : 48 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 63 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.689238 RENAME_VARIABLES(MILLISECONDS) : 0.564804 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.638646 PROJECTAWAY(MILLISECONDS) : 1.321977 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001184 DISJOIN(MILLISECONDS) : 0.469742 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.603202 ADD_EQUALITY(MILLISECONDS) : 0.016333 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014883 #CONJOIN_DISJUNCTIVE : 78 #RENAME_VARIABLES : 133 #UNFREEZE : 0 #CONJOIN : 134 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 65 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 235 LocStat_NO_SUPPORTING_DISEQUALITIES : 48 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 63 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.485607 RENAME_VARIABLES(MILLISECONDS) : 0.429229 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.446975 PROJECTAWAY(MILLISECONDS) : 0.808673 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001024 DISJOIN(MILLISECONDS) : 0.439055 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.460694 ADD_EQUALITY(MILLISECONDS) : 0.014158 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008429 #CONJOIN_DISJUNCTIVE : 78 #RENAME_VARIABLES : 133 #UNFREEZE : 0 #CONJOIN : 134 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 65 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (111states) and interpolant automaton (currently 20 states, 29 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 66. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 15 error locations. TIMEOUT Result, 66.3s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 54.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 562 SDtfs, 1099 SDslu, 2468 SDs, 0 SdLazy, 2155 SolverSat, 235 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 281 SyntacticMatches, 19 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3498 ImplicationChecksByTransitivity, 55.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 122 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 683 ConstructedInterpolants, 74 QuantifiedInterpolants, 236293 SizeOfPredicates, 124 NumberOfNonLiveVariables, 932 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 8/110 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/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-42-25-346.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-42-25-346.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-42-25-346.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-42-25-346.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-42-25-346.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_16-42-25-346.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_16-42-25-346.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-42-25-346.csv Completed graceful shutdown