java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-invgen/up_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:40:03,118 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:40:03,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:40:03,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:40:03,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:40:03,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:40:03,146 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:40:03,148 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:40:03,151 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:40:03,151 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:40:03,155 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:40:03,155 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:40:03,156 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:40:03,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:40:03,161 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:40:03,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:40:03,162 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:40:03,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:40:03,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:40:03,177 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:40:03,180 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:40:03,182 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:40:03,186 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:40:03,186 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:40:03,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:40:03,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:40:03,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:40:03,193 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:40:03,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:40:03,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:40:03,198 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:40:03,199 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:40:03,199 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:40:03,200 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:40:03,202 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:40:03,202 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:40:03,202 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:40:03,217 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:40:03,218 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:40:03,218 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:40:03,218 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:40:03,219 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:40:03,219 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:40:03,219 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:40:03,219 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:40:03,219 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:40:03,220 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:40:03,220 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:40:03,220 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:40:03,220 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:40:03,221 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:40:03,221 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:40:03,221 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:40:03,221 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:40:03,222 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:40:03,222 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:40:03,222 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:40:03,222 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:40:03,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:40:03,223 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:40:03,223 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:40:03,223 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:40:03,223 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:40:03,223 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:40:03,224 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:40:03,224 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:40:03,224 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:40:03,224 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:40:03,224 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:40:03,224 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:40:03,225 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:40:03,225 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:40:03,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:40:03,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:40:03,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:40:03,284 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:40:03,284 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:40:03,285 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/up_true-unreach-call_true-termination.i [2018-11-12 20:40:03,342 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c534f33/59a9e410001845008dbac0adcd9abc85/FLAGe476650ec [2018-11-12 20:40:03,741 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:40:03,741 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/up_true-unreach-call_true-termination.i [2018-11-12 20:40:03,747 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c534f33/59a9e410001845008dbac0adcd9abc85/FLAGe476650ec [2018-11-12 20:40:03,762 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75c534f33/59a9e410001845008dbac0adcd9abc85 [2018-11-12 20:40:03,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:40:03,774 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:40:03,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:40:03,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:40:03,779 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:40:03,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:40:03" (1/1) ... [2018-11-12 20:40:03,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e0d818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:03, skipping insertion in model container [2018-11-12 20:40:03,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:40:03" (1/1) ... [2018-11-12 20:40:03,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:40:03,820 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:40:04,050 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:40:04,054 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:40:04,071 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:40:04,085 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:40:04,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:04 WrapperNode [2018-11-12 20:40:04,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:40:04,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:40:04,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:40:04,087 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:40:04,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:04" (1/1) ... [2018-11-12 20:40:04,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:04" (1/1) ... [2018-11-12 20:40:04,106 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:40:04,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:40:04,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:40:04,106 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:40:04,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:04" (1/1) ... [2018-11-12 20:40:04,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:04" (1/1) ... [2018-11-12 20:40:04,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:04" (1/1) ... [2018-11-12 20:40:04,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:04" (1/1) ... [2018-11-12 20:40:04,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:04" (1/1) ... [2018-11-12 20:40:04,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:04" (1/1) ... [2018-11-12 20:40:04,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:04" (1/1) ... [2018-11-12 20:40:04,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:40:04,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:40:04,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:40:04,129 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:40:04,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:04" (1/1) ... No working directory specified, using /storage/repos/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-11-12 20:40:04,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:40:04,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:40:04,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:40:04,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:40:04,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:40:04,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:40:04,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:40:04,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:40:04,526 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:40:04,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:40:04 BoogieIcfgContainer [2018-11-12 20:40:04,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:40:04,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:40:04,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:40:04,543 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:40:04,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:40:03" (1/3) ... [2018-11-12 20:40:04,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf271ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:40:04, skipping insertion in model container [2018-11-12 20:40:04,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:40:04" (2/3) ... [2018-11-12 20:40:04,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf271ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:40:04, skipping insertion in model container [2018-11-12 20:40:04,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:40:04" (3/3) ... [2018-11-12 20:40:04,550 INFO L112 eAbstractionObserver]: Analyzing ICFG up_true-unreach-call_true-termination.i [2018-11-12 20:40:04,561 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:40:04,569 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:40:04,588 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:40:04,627 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:40:04,627 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:40:04,627 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:40:04,628 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:40:04,628 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:40:04,628 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:40:04,628 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:40:04,628 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:40:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-12 20:40:04,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-12 20:40:04,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:04,656 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:04,658 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:04,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:04,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1884544245, now seen corresponding path program 1 times [2018-11-12 20:40:04,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:04,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:04,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:04,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:04,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:04,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:04,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:40:04,793 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:04,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:40:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:40:04,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:40:04,812 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-12 20:40:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:04,832 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-12 20:40:04,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:40:04,833 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-12 20:40:04,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:04,842 INFO L225 Difference]: With dead ends: 37 [2018-11-12 20:40:04,842 INFO L226 Difference]: Without dead ends: 18 [2018-11-12 20:40:04,845 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:40:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-12 20:40:04,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-12 20:40:04,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-12 20:40:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-12 20:40:04,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-12 20:40:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:04,899 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-12 20:40:04,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:40:04,899 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-12 20:40:04,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 20:40:04,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:04,900 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:04,901 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:04,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:04,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1969781111, now seen corresponding path program 1 times [2018-11-12 20:40:04,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:04,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:04,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:04,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:04,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:05,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:05,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:40:05,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:05,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:40:05,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:40:05,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:40:05,197 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2018-11-12 20:40:05,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:05,331 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-12 20:40:05,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:40:05,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-12 20:40:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:05,333 INFO L225 Difference]: With dead ends: 33 [2018-11-12 20:40:05,333 INFO L226 Difference]: Without dead ends: 20 [2018-11-12 20:40:05,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-12 20:40:05,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-12 20:40:05,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-12 20:40:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-12 20:40:05,343 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-12 20:40:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:05,344 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-12 20:40:05,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:40:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-12 20:40:05,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-12 20:40:05,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:05,345 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:05,345 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:05,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:05,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1960344783, now seen corresponding path program 1 times [2018-11-12 20:40:05,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:05,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:05,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:05,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:05,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:05,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:40:05,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 20:40:05,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:40:05,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:40:05,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:40:05,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:40:05,496 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-12 20:40:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:05,649 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-12 20:40:05,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:40:05,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-12 20:40:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:05,652 INFO L225 Difference]: With dead ends: 34 [2018-11-12 20:40:05,652 INFO L226 Difference]: Without dead ends: 32 [2018-11-12 20:40:05,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:40:05,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-12 20:40:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-12 20:40:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-12 20:40:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-12 20:40:05,664 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2018-11-12 20:40:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:05,664 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-12 20:40:05,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:40:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-12 20:40:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-12 20:40:05,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:05,666 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:05,666 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:05,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1864992939, now seen corresponding path program 1 times [2018-11-12 20:40:05,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:05,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:05,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:05,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:05,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:05,942 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-12 20:40:05,944 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [22], [28], [30], [35], [38], [40], [43], [45], [46], [47], [48], [50], [51] [2018-11-12 20:40:05,979 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:40:05,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:40:06,320 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:40:06,324 INFO L272 AbstractInterpreter]: Visited 19 different actions 115 times. Merged at 8 different actions 48 times. Widened at 3 different actions 6 times. Performed 287 root evaluator evaluations with a maximum evaluation depth of 6. Performed 287 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 7 fixpoints after 3 different actions. Largest state had 9 variables. [2018-11-12 20:40:06,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:06,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:40:06,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:06,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-12 20:40:06,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:06,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:06,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:06,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:06,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:06,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2018-11-12 20:40:06,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:06,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:40:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:40:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:40:06,654 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-11-12 20:40:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:06,863 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-12 20:40:06,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:40:06,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-12 20:40:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:06,866 INFO L225 Difference]: With dead ends: 46 [2018-11-12 20:40:06,866 INFO L226 Difference]: Without dead ends: 29 [2018-11-12 20:40:06,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:40:06,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-12 20:40:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-12 20:40:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-12 20:40:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-12 20:40:06,876 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-11-12 20:40:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:06,877 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-12 20:40:06,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:40:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-12 20:40:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-12 20:40:06,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:06,879 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:06,879 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:06,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:06,880 INFO L82 PathProgramCache]: Analyzing trace with hash -62381937, now seen corresponding path program 2 times [2018-11-12 20:40:06,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:06,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:06,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:06,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:06,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:07,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:07,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:07,017 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:07,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:07,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:07,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-12 20:40:07,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:07,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:07,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:40:07,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:07,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:07,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:40:07,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:07,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2018-11-12 20:40:07,489 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:07,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:40:07,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:40:07,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-12 20:40:07,490 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 10 states. [2018-11-12 20:40:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:07,634 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-12 20:40:07,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:40:07,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-12 20:40:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:07,637 INFO L225 Difference]: With dead ends: 39 [2018-11-12 20:40:07,638 INFO L226 Difference]: Without dead ends: 37 [2018-11-12 20:40:07,638 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:40:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-12 20:40:07,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-12 20:40:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-12 20:40:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-12 20:40:07,645 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2018-11-12 20:40:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:07,645 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-12 20:40:07,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:40:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-12 20:40:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-12 20:40:07,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:07,647 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:07,647 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:07,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:07,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1261098675, now seen corresponding path program 3 times [2018-11-12 20:40:07,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:07,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:07,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:07,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:07,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:07,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:07,830 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:07,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:07,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:07,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:07,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:07,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:07,884 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:07,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:07,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:08,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:08,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:08,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2018-11-12 20:40:08,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:08,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:40:08,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:40:08,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:40:08,146 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 12 states. [2018-11-12 20:40:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:08,328 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-12 20:40:08,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:40:08,329 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-12 20:40:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:08,330 INFO L225 Difference]: With dead ends: 60 [2018-11-12 20:40:08,330 INFO L226 Difference]: Without dead ends: 39 [2018-11-12 20:40:08,331 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:40:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-12 20:40:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-12 20:40:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-12 20:40:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-12 20:40:08,338 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-11-12 20:40:08,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:08,339 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-12 20:40:08,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:40:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-12 20:40:08,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-12 20:40:08,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:08,340 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:08,341 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:08,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:08,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1825718419, now seen corresponding path program 4 times [2018-11-12 20:40:08,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:08,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:08,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:08,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:08,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-12 20:40:08,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:08,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:08,510 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:08,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:08,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:08,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-12 20:40:08,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:08,519 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:08,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:08,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:08,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:40:08,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:08,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2018-11-12 20:40:08,695 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:08,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:40:08,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:40:08,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:40:08,697 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-11-12 20:40:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:08,871 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-12 20:40:08,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:40:08,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-12 20:40:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:08,874 INFO L225 Difference]: With dead ends: 49 [2018-11-12 20:40:08,875 INFO L226 Difference]: Without dead ends: 47 [2018-11-12 20:40:08,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-12 20:40:08,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-12 20:40:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-12 20:40:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-12 20:40:08,882 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 36 [2018-11-12 20:40:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:08,883 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-12 20:40:08,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:40:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-12 20:40:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-12 20:40:08,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:08,884 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:08,885 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:08,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:08,885 INFO L82 PathProgramCache]: Analyzing trace with hash -51726447, now seen corresponding path program 5 times [2018-11-12 20:40:08,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:08,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:08,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:08,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:08,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:09,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:09,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:09,012 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:09,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:09,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:09,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:09,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:09,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:09,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-12 20:40:09,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:09,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:09,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:09,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:09,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2018-11-12 20:40:09,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:09,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:40:09,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:40:09,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:40:09,450 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 15 states. [2018-11-12 20:40:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:09,767 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-12 20:40:09,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:40:09,768 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 44 [2018-11-12 20:40:09,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:09,769 INFO L225 Difference]: With dead ends: 74 [2018-11-12 20:40:09,769 INFO L226 Difference]: Without dead ends: 49 [2018-11-12 20:40:09,770 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:40:09,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-12 20:40:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-12 20:40:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-12 20:40:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-12 20:40:09,778 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2018-11-12 20:40:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:09,779 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-12 20:40:09,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:40:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-12 20:40:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-12 20:40:09,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:09,781 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:09,781 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:09,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash 446005195, now seen corresponding path program 6 times [2018-11-12 20:40:09,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:09,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:09,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:09,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:09,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-12 20:40:09,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:09,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:09,955 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:09,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:09,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:09,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-12 20:40:09,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:09,964 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:09,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:09,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:09,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:10,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-12 20:40:10,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:10,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2018-11-12 20:40:10,159 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:10,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:40:10,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:40:10,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-12 20:40:10,160 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 12 states. [2018-11-12 20:40:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:10,308 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-12 20:40:10,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:40:10,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-12 20:40:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:10,311 INFO L225 Difference]: With dead ends: 59 [2018-11-12 20:40:10,311 INFO L226 Difference]: Without dead ends: 57 [2018-11-12 20:40:10,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:40:10,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-12 20:40:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-12 20:40:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-12 20:40:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-12 20:40:10,319 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2018-11-12 20:40:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:10,320 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-12 20:40:10,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:40:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-12 20:40:10,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-12 20:40:10,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:10,321 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:10,321 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:10,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:10,322 INFO L82 PathProgramCache]: Analyzing trace with hash -239912465, now seen corresponding path program 7 times [2018-11-12 20:40:10,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:10,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:10,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:10,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:10,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:10,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:10,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:10,471 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:10,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:10,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:10,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:10,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:10,481 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:10,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:10,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 20 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:10,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:10,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2018-11-12 20:40:10,827 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:10,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:40:10,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:40:10,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:40:10,828 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 18 states. [2018-11-12 20:40:11,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:11,235 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-12 20:40:11,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:40:11,236 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-11-12 20:40:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:11,237 INFO L225 Difference]: With dead ends: 88 [2018-11-12 20:40:11,237 INFO L226 Difference]: Without dead ends: 59 [2018-11-12 20:40:11,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 94 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:40:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-12 20:40:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-12 20:40:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-12 20:40:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-12 20:40:11,246 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-11-12 20:40:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:11,246 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-12 20:40:11,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:40:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-12 20:40:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-12 20:40:11,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:11,248 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:11,248 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:11,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash -363560535, now seen corresponding path program 8 times [2018-11-12 20:40:11,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:11,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:11,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:11,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:11,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 37 proven. 46 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:40:11,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:11,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:11,366 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:11,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:11,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:11,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:11,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:11,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:11,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:40:11,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:11,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:11,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-12 20:40:11,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:11,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2018-11-12 20:40:11,686 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:11,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:40:11,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:40:11,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:40:11,688 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 13 states. [2018-11-12 20:40:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:11,867 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-11-12 20:40:11,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:40:11,867 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-11-12 20:40:11,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:11,869 INFO L225 Difference]: With dead ends: 69 [2018-11-12 20:40:11,869 INFO L226 Difference]: Without dead ends: 67 [2018-11-12 20:40:11,870 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:40:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-12 20:40:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-12 20:40:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-12 20:40:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-11-12 20:40:11,880 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2018-11-12 20:40:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:11,883 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-11-12 20:40:11,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:40:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-11-12 20:40:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-12 20:40:11,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:11,884 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:11,885 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:11,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1782152653, now seen corresponding path program 9 times [2018-11-12 20:40:11,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:11,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:11,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:11,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:11,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:12,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:12,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:12,131 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:12,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:12,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:12,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:12,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:12,157 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:12,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:12,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:12,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:12,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 65 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:12,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:12,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2018-11-12 20:40:12,494 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:12,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:40:12,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:40:12,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:40:12,495 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 21 states. [2018-11-12 20:40:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:12,989 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-11-12 20:40:12,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:40:12,990 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-12 20:40:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:12,991 INFO L225 Difference]: With dead ends: 102 [2018-11-12 20:40:12,991 INFO L226 Difference]: Without dead ends: 69 [2018-11-12 20:40:12,992 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 111 SyntacticMatches, 12 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:40:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-12 20:40:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-12 20:40:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-12 20:40:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-12 20:40:13,000 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2018-11-12 20:40:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:13,000 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-12 20:40:13,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:40:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-12 20:40:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-12 20:40:13,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:13,002 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:13,002 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:13,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1767367943, now seen corresponding path program 10 times [2018-11-12 20:40:13,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:13,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:13,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 51 proven. 68 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 20:40:13,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:13,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:13,196 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:13,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:13,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:13,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:13,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:13,207 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:13,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 52 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:13,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 52 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:40:13,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:13,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2018-11-12 20:40:13,591 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:13,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:40:13,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:40:13,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:40:13,593 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2018-11-12 20:40:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:13,869 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-11-12 20:40:13,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:40:13,869 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-11-12 20:40:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:13,870 INFO L225 Difference]: With dead ends: 79 [2018-11-12 20:40:13,870 INFO L226 Difference]: Without dead ends: 77 [2018-11-12 20:40:13,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 125 SyntacticMatches, 13 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:40:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-12 20:40:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-11-12 20:40:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-12 20:40:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-11-12 20:40:13,884 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 66 [2018-11-12 20:40:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:13,884 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-11-12 20:40:13,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:40:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-11-12 20:40:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-12 20:40:13,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:13,885 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:13,889 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:13,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:13,890 INFO L82 PathProgramCache]: Analyzing trace with hash 508207915, now seen corresponding path program 11 times [2018-11-12 20:40:13,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:13,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:13,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:13,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:13,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:14,159 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:14,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:14,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:14,160 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:14,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:14,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:14,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:14,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:14,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:14,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-12 20:40:14,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:14,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:14,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:14,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:14,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2018-11-12 20:40:14,842 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:14,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:40:14,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:40:14,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:40:14,843 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 24 states. [2018-11-12 20:40:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:15,233 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-11-12 20:40:15,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:40:15,234 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-11-12 20:40:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:15,236 INFO L225 Difference]: With dead ends: 116 [2018-11-12 20:40:15,236 INFO L226 Difference]: Without dead ends: 79 [2018-11-12 20:40:15,237 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 128 SyntacticMatches, 14 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:40:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-12 20:40:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-12 20:40:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-12 20:40:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-11-12 20:40:15,244 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2018-11-12 20:40:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:15,244 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-11-12 20:40:15,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:40:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-11-12 20:40:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-12 20:40:15,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:15,246 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:15,246 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:15,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash 262457829, now seen corresponding path program 12 times [2018-11-12 20:40:15,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:15,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:15,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:15,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 67 proven. 94 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-12 20:40:15,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:15,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:15,460 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:15,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:15,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:15,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:15,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:15,469 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:15,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:15,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:15,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:15,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 68 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-12 20:40:15,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:15,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 15 [2018-11-12 20:40:15,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:15,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:40:15,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:40:15,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:40:15,635 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 15 states. [2018-11-12 20:40:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:15,811 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-11-12 20:40:15,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:40:15,811 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-11-12 20:40:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:15,813 INFO L225 Difference]: With dead ends: 89 [2018-11-12 20:40:15,813 INFO L226 Difference]: Without dead ends: 87 [2018-11-12 20:40:15,814 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 144 SyntacticMatches, 15 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:40:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-12 20:40:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-12 20:40:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-12 20:40:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-11-12 20:40:15,819 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 76 [2018-11-12 20:40:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:15,820 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-11-12 20:40:15,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:40:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-11-12 20:40:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-12 20:40:15,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:15,821 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:15,821 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:15,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1053542921, now seen corresponding path program 13 times [2018-11-12 20:40:15,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:15,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:15,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:15,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:15,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:16,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:16,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:16,522 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:16,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:16,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:16,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:16,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:16,531 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:16,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:16,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 119 proven. 56 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:16,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:16,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 27 [2018-11-12 20:40:16,911 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:16,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:40:16,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:40:16,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:40:16,912 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 27 states. [2018-11-12 20:40:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:17,231 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-12 20:40:17,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:40:17,231 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-11-12 20:40:17,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:17,232 INFO L225 Difference]: With dead ends: 130 [2018-11-12 20:40:17,233 INFO L226 Difference]: Without dead ends: 89 [2018-11-12 20:40:17,234 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 145 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=323, Invalid=937, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:40:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-12 20:40:17,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-12 20:40:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-12 20:40:17,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-11-12 20:40:17,240 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2018-11-12 20:40:17,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:17,240 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-11-12 20:40:17,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:40:17,241 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-11-12 20:40:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-12 20:40:17,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:17,242 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:17,242 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:17,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:17,242 INFO L82 PathProgramCache]: Analyzing trace with hash -396865469, now seen corresponding path program 14 times [2018-11-12 20:40:17,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:17,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:17,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:17,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:17,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 85 proven. 124 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-12 20:40:17,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:17,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:17,405 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:17,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:17,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:17,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:17,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:17,413 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:17,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:40:17,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:17,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:17,546 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:17,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 105 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 20:40:17,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:17,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2018-11-12 20:40:17,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:17,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:40:17,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:40:17,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-11-12 20:40:17,693 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 16 states. [2018-11-12 20:40:17,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:17,862 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-11-12 20:40:17,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:40:17,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2018-11-12 20:40:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:17,864 INFO L225 Difference]: With dead ends: 99 [2018-11-12 20:40:17,865 INFO L226 Difference]: Without dead ends: 97 [2018-11-12 20:40:17,865 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 163 SyntacticMatches, 17 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:40:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-12 20:40:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-11-12 20:40:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-12 20:40:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-11-12 20:40:17,872 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 86 [2018-11-12 20:40:17,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:17,873 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-11-12 20:40:17,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:40:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-11-12 20:40:17,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-12 20:40:17,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:17,874 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:17,874 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:17,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:17,875 INFO L82 PathProgramCache]: Analyzing trace with hash -138800537, now seen corresponding path program 15 times [2018-11-12 20:40:17,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:17,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:17,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:17,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:17,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:40:18,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:18,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:18,159 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:18,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:18,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:18,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:18,168 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:18,168 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:18,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:18,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:18,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:40:18,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 152 proven. 72 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:40:18,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:18,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 30 [2018-11-12 20:40:18,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:18,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:40:18,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:40:18,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:40:18,672 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 30 states. [2018-11-12 20:40:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:18,946 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-11-12 20:40:18,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:40:18,947 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 94 [2018-11-12 20:40:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:18,948 INFO L225 Difference]: With dead ends: 144 [2018-11-12 20:40:18,948 INFO L226 Difference]: Without dead ends: 99 [2018-11-12 20:40:18,950 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 162 SyntacticMatches, 18 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=394, Invalid=1166, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:40:18,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-12 20:40:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-12 20:40:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-12 20:40:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-11-12 20:40:18,956 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2018-11-12 20:40:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:18,957 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-11-12 20:40:18,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:40:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-11-12 20:40:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-12 20:40:18,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:18,958 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:18,958 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:18,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:18,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1817733087, now seen corresponding path program 16 times [2018-11-12 20:40:18,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:18,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:18,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:18,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:18,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 105 proven. 158 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-12 20:40:19,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:19,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:19,126 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:19,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:19,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:19,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:19,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:19,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:19,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 136 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:40:19,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 136 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-12 20:40:19,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:19,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 17 [2018-11-12 20:40:19,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:19,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:40:19,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:40:19,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:40:19,366 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 17 states. [2018-11-12 20:40:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:19,777 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-11-12 20:40:19,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:40:19,778 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-12 20:40:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:19,780 INFO L225 Difference]: With dead ends: 109 [2018-11-12 20:40:19,780 INFO L226 Difference]: Without dead ends: 107 [2018-11-12 20:40:19,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 182 SyntacticMatches, 19 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:40:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-12 20:40:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-12 20:40:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-12 20:40:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-11-12 20:40:19,787 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 96 [2018-11-12 20:40:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:19,787 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-11-12 20:40:19,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:40:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-11-12 20:40:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-12 20:40:19,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:19,789 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:19,789 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:19,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:19,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1915395141, now seen corresponding path program 17 times [2018-11-12 20:40:19,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:19,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:19,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:19,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:19,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:40:20,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:20,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:20,209 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:20,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:20,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:20,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:20,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:20,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:20,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-12 20:40:20,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:20,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:20,500 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:40:20,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 189 proven. 90 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:40:20,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:20,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 33 [2018-11-12 20:40:20,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:20,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:40:20,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:40:20,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:40:20,721 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 33 states. [2018-11-12 20:40:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:21,258 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2018-11-12 20:40:21,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:40:21,258 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-11-12 20:40:21,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:21,259 INFO L225 Difference]: With dead ends: 158 [2018-11-12 20:40:21,260 INFO L226 Difference]: Without dead ends: 109 [2018-11-12 20:40:21,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 179 SyntacticMatches, 20 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=472, Invalid=1420, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:40:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-12 20:40:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-11-12 20:40:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-12 20:40:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-11-12 20:40:21,268 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2018-11-12 20:40:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:21,268 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-11-12 20:40:21,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:40:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-11-12 20:40:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-12 20:40:21,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:21,269 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:21,270 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:21,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:21,270 INFO L82 PathProgramCache]: Analyzing trace with hash -924860033, now seen corresponding path program 18 times [2018-11-12 20:40:21,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:21,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:21,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:21,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:21,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:21,774 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 127 proven. 196 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-12 20:40:21,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:21,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:21,774 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:21,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:21,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:21,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:21,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:21,783 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:21,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:21,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:21,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 128 proven. 171 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:40:21,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 128 proven. 171 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-12 20:40:22,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:22,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2018-11-12 20:40:22,156 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:22,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:40:22,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:40:22,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-11-12 20:40:22,157 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 18 states. [2018-11-12 20:40:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:22,407 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2018-11-12 20:40:22,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:40:22,408 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 106 [2018-11-12 20:40:22,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:22,410 INFO L225 Difference]: With dead ends: 119 [2018-11-12 20:40:22,410 INFO L226 Difference]: Without dead ends: 117 [2018-11-12 20:40:22,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 201 SyntacticMatches, 21 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:40:22,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-12 20:40:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-11-12 20:40:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-12 20:40:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-11-12 20:40:22,416 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 106 [2018-11-12 20:40:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:22,417 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-11-12 20:40:22,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:40:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-11-12 20:40:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-12 20:40:22,418 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:22,418 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:22,418 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:22,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:22,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1447724963, now seen corresponding path program 19 times [2018-11-12 20:40:22,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:22,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:22,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:22,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:22,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:40:22,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:22,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:22,667 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:22,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:22,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:22,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:22,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:22,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:22,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:23,279 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:40:23,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 230 proven. 110 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:40:23,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:23,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 36 [2018-11-12 20:40:23,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:23,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:40:23,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:40:23,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:40:23,535 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 36 states. [2018-11-12 20:40:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:24,049 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-11-12 20:40:24,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:40:24,052 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 114 [2018-11-12 20:40:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:24,053 INFO L225 Difference]: With dead ends: 172 [2018-11-12 20:40:24,053 INFO L226 Difference]: Without dead ends: 119 [2018-11-12 20:40:24,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 196 SyntacticMatches, 22 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=557, Invalid=1699, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:40:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-12 20:40:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-11-12 20:40:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-12 20:40:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-11-12 20:40:24,062 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-11-12 20:40:24,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:24,062 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-11-12 20:40:24,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:40:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-11-12 20:40:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-12 20:40:24,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:24,063 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:24,063 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:24,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:24,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1483074653, now seen corresponding path program 20 times [2018-11-12 20:40:24,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:24,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:24,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:24,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:24,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 151 proven. 238 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-12 20:40:25,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:25,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:25,123 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:25,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:25,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:25,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:25,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:25,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:25,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:40:25,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:25,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 152 proven. 210 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:40:25,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 152 proven. 210 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-12 20:40:25,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:25,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 19 [2018-11-12 20:40:25,537 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:25,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:40:25,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:40:25,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:40:25,538 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 19 states. [2018-11-12 20:40:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:25,719 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-11-12 20:40:25,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:40:25,719 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 116 [2018-11-12 20:40:25,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:25,721 INFO L225 Difference]: With dead ends: 129 [2018-11-12 20:40:25,721 INFO L226 Difference]: Without dead ends: 127 [2018-11-12 20:40:25,722 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 220 SyntacticMatches, 23 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:40:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-12 20:40:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-11-12 20:40:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-12 20:40:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-11-12 20:40:25,728 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 116 [2018-11-12 20:40:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:25,729 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-11-12 20:40:25,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:40:25,729 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-11-12 20:40:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-12 20:40:25,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:25,730 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:25,730 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:25,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:25,730 INFO L82 PathProgramCache]: Analyzing trace with hash -849415039, now seen corresponding path program 21 times [2018-11-12 20:40:25,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:25,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:25,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:25,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:25,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:40:26,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:26,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:26,144 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:26,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:26,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:26,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:26,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:26,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:26,186 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:26,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:26,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:40:26,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 275 proven. 132 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:40:26,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:26,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 39 [2018-11-12 20:40:26,795 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:26,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:40:26,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:40:26,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1119, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:40:26,797 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 39 states. [2018-11-12 20:40:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:27,352 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2018-11-12 20:40:27,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:40:27,360 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 124 [2018-11-12 20:40:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:27,361 INFO L225 Difference]: With dead ends: 186 [2018-11-12 20:40:27,361 INFO L226 Difference]: Without dead ends: 129 [2018-11-12 20:40:27,362 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 213 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=649, Invalid=2003, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:40:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-12 20:40:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-11-12 20:40:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-12 20:40:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-11-12 20:40:27,370 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2018-11-12 20:40:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:27,371 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-11-12 20:40:27,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:40:27,371 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-11-12 20:40:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-12 20:40:27,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:27,372 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:27,372 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:27,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:27,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1380501317, now seen corresponding path program 22 times [2018-11-12 20:40:27,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:27,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:27,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:27,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:27,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 177 proven. 284 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-12 20:40:27,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:27,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:27,582 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:27,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:27,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:27,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:27,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:27,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:27,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 178 proven. 253 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:40:27,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 178 proven. 253 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-12 20:40:27,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:27,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 20 [2018-11-12 20:40:27,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:27,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:40:27,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:40:27,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-11-12 20:40:27,895 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 20 states. [2018-11-12 20:40:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:28,097 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-11-12 20:40:28,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:40:28,098 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 126 [2018-11-12 20:40:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:28,100 INFO L225 Difference]: With dead ends: 139 [2018-11-12 20:40:28,100 INFO L226 Difference]: Without dead ends: 137 [2018-11-12 20:40:28,100 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 239 SyntacticMatches, 25 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:40:28,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-12 20:40:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-11-12 20:40:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-12 20:40:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-11-12 20:40:28,107 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 126 [2018-11-12 20:40:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:28,108 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-11-12 20:40:28,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:40:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-11-12 20:40:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-12 20:40:28,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:28,109 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:28,109 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:28,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:28,109 INFO L82 PathProgramCache]: Analyzing trace with hash 63242975, now seen corresponding path program 23 times [2018-11-12 20:40:28,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:28,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:28,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:28,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:28,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 324 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-12 20:40:28,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:28,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:28,660 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:28,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:28,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:28,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:28,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:28,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:28,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-12 20:40:28,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:28,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 324 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-12 20:40:29,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 324 proven. 156 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-12 20:40:29,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:29,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 42 [2018-11-12 20:40:29,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:29,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:40:29,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:40:29,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1303, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:40:29,373 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 42 states. [2018-11-12 20:40:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:30,033 INFO L93 Difference]: Finished difference Result 200 states and 214 transitions. [2018-11-12 20:40:30,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:40:30,034 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 134 [2018-11-12 20:40:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:30,035 INFO L225 Difference]: With dead ends: 200 [2018-11-12 20:40:30,035 INFO L226 Difference]: Without dead ends: 139 [2018-11-12 20:40:30,037 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 230 SyntacticMatches, 26 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=748, Invalid=2332, Unknown=0, NotChecked=0, Total=3080 [2018-11-12 20:40:30,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-12 20:40:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-11-12 20:40:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-12 20:40:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-11-12 20:40:30,044 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-11-12 20:40:30,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:30,045 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-11-12 20:40:30,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:40:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-11-12 20:40:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-12 20:40:30,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:30,046 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:30,046 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:30,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:30,046 INFO L82 PathProgramCache]: Analyzing trace with hash -781662567, now seen corresponding path program 24 times [2018-11-12 20:40:30,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:30,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:30,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:30,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:30,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 205 proven. 334 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-12 20:40:30,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:30,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:30,458 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:30,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:30,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:30,458 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:30,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:30,470 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:30,508 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:30,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:30,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 206 proven. 300 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-12 20:40:30,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 206 proven. 300 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-12 20:40:30,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:30,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 21 [2018-11-12 20:40:30,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:30,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:40:30,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:40:30,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:40:30,849 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 21 states. [2018-11-12 20:40:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:31,281 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-11-12 20:40:31,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:40:31,281 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 136 [2018-11-12 20:40:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:31,283 INFO L225 Difference]: With dead ends: 149 [2018-11-12 20:40:31,283 INFO L226 Difference]: Without dead ends: 147 [2018-11-12 20:40:31,284 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 258 SyntacticMatches, 27 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:40:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-12 20:40:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-11-12 20:40:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-12 20:40:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-11-12 20:40:31,291 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 136 [2018-11-12 20:40:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:31,292 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-11-12 20:40:31,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:40:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-11-12 20:40:31,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-12 20:40:31,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:31,293 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:31,293 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:31,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:31,293 INFO L82 PathProgramCache]: Analyzing trace with hash 720491197, now seen corresponding path program 25 times [2018-11-12 20:40:31,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:31,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:31,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 377 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-12 20:40:31,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:31,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:31,662 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:31,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:31,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:31,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:31,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:31,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:31,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 377 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-12 20:40:33,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 377 proven. 182 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-12 20:40:33,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:33,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 45 [2018-11-12 20:40:33,779 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:33,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:40:33,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:40:33,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1501, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:40:33,781 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 45 states. [2018-11-12 20:40:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:35,966 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2018-11-12 20:40:35,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:40:35,967 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 144 [2018-11-12 20:40:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:35,968 INFO L225 Difference]: With dead ends: 214 [2018-11-12 20:40:35,968 INFO L226 Difference]: Without dead ends: 149 [2018-11-12 20:40:35,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 247 SyntacticMatches, 28 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=854, Invalid=2686, Unknown=0, NotChecked=0, Total=3540 [2018-11-12 20:40:35,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-12 20:40:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-11-12 20:40:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-12 20:40:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-11-12 20:40:35,978 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2018-11-12 20:40:35,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:35,978 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-11-12 20:40:35,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:40:35,978 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-11-12 20:40:35,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-12 20:40:35,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:35,979 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:35,980 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:35,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:35,980 INFO L82 PathProgramCache]: Analyzing trace with hash -349719049, now seen corresponding path program 26 times [2018-11-12 20:40:35,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:35,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:35,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:35,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:35,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 235 proven. 388 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-12 20:40:36,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:36,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:36,466 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:36,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:36,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:36,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:36,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:36,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:36,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-12 20:40:36,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:36,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 236 proven. 351 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-12 20:40:36,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 236 proven. 351 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-12 20:40:36,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:36,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 22 [2018-11-12 20:40:36,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:36,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:40:36,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:40:36,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2018-11-12 20:40:36,908 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 22 states. [2018-11-12 20:40:37,707 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-11-12 20:40:37,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:37,778 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-11-12 20:40:37,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:40:37,778 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 146 [2018-11-12 20:40:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:37,780 INFO L225 Difference]: With dead ends: 159 [2018-11-12 20:40:37,780 INFO L226 Difference]: Without dead ends: 157 [2018-11-12 20:40:37,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 277 SyntacticMatches, 29 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:40:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-12 20:40:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-11-12 20:40:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-12 20:40:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-11-12 20:40:37,792 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 146 [2018-11-12 20:40:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:37,794 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-11-12 20:40:37,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:40:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-11-12 20:40:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-12 20:40:37,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:37,795 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:37,795 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:37,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash -76381157, now seen corresponding path program 27 times [2018-11-12 20:40:37,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:37,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:37,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:37,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:37,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 434 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-12 20:40:38,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:38,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:38,664 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:38,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:38,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:38,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:38,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:38,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:38,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:38,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:38,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 434 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-12 20:40:39,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 434 proven. 210 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-12 20:40:39,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:39,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 48 [2018-11-12 20:40:39,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:39,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-12 20:40:39,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-12 20:40:39,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=1713, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:40:39,564 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 48 states. [2018-11-12 20:40:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:40,041 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2018-11-12 20:40:40,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 20:40:40,042 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 154 [2018-11-12 20:40:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:40,043 INFO L225 Difference]: With dead ends: 228 [2018-11-12 20:40:40,043 INFO L226 Difference]: Without dead ends: 159 [2018-11-12 20:40:40,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 264 SyntacticMatches, 30 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2018-11-12 20:40:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-12 20:40:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-11-12 20:40:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-12 20:40:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-11-12 20:40:40,054 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2018-11-12 20:40:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:40,054 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-11-12 20:40:40,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-12 20:40:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-11-12 20:40:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-12 20:40:40,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:40,056 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:40,056 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:40,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:40,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1136207573, now seen corresponding path program 28 times [2018-11-12 20:40:40,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:40,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:40,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:40,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:40,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 267 proven. 446 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-12 20:40:40,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:40,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:40,331 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:40,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:40,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:40,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:40,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:40,339 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:40,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 268 proven. 406 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-12 20:40:40,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 268 proven. 406 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-12 20:40:40,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:40,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 23 [2018-11-12 20:40:40,929 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:40,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:40:40,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:40:40,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:40:40,930 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 23 states. [2018-11-12 20:40:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:41,642 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2018-11-12 20:40:41,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:40:41,642 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 156 [2018-11-12 20:40:41,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:41,644 INFO L225 Difference]: With dead ends: 169 [2018-11-12 20:40:41,644 INFO L226 Difference]: Without dead ends: 167 [2018-11-12 20:40:41,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 296 SyntacticMatches, 31 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:40:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-12 20:40:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-11-12 20:40:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-12 20:40:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-11-12 20:40:41,652 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 156 [2018-11-12 20:40:41,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:41,653 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-11-12 20:40:41,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:40:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-11-12 20:40:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-12 20:40:41,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:41,654 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:41,654 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:41,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:41,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1226033415, now seen corresponding path program 29 times [2018-11-12 20:40:41,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:41,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:41,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:41,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:41,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 495 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-12 20:40:42,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:42,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:42,162 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:42,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:42,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:42,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:42,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:42,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:42,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-12 20:40:42,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:42,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 495 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-12 20:40:42,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 495 proven. 240 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-12 20:40:43,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:43,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 51 [2018-11-12 20:40:43,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:43,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-12 20:40:43,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-12 20:40:43,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=1939, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:40:43,288 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 51 states. [2018-11-12 20:40:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:44,279 INFO L93 Difference]: Finished difference Result 242 states and 259 transitions. [2018-11-12 20:40:44,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:40:44,279 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 164 [2018-11-12 20:40:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:44,280 INFO L225 Difference]: With dead ends: 242 [2018-11-12 20:40:44,280 INFO L226 Difference]: Without dead ends: 169 [2018-11-12 20:40:44,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 281 SyntacticMatches, 32 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1087, Invalid=3469, Unknown=0, NotChecked=0, Total=4556 [2018-11-12 20:40:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-12 20:40:44,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-11-12 20:40:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-12 20:40:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-11-12 20:40:44,292 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2018-11-12 20:40:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:44,292 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-11-12 20:40:44,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-12 20:40:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-11-12 20:40:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-12 20:40:44,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:44,294 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:44,294 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:44,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:44,294 INFO L82 PathProgramCache]: Analyzing trace with hash -956679885, now seen corresponding path program 30 times [2018-11-12 20:40:44,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:44,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:44,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:44,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:44,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 301 proven. 508 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-12 20:40:45,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:45,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:45,242 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:45,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:45,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:45,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:45,258 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:45,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:45,329 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:45,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:45,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 302 proven. 465 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-12 20:40:45,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:46,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 302 proven. 465 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-11-12 20:40:46,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:46,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 24 [2018-11-12 20:40:46,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:46,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:40:46,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:40:46,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2018-11-12 20:40:46,059 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 24 states. [2018-11-12 20:40:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:46,389 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-11-12 20:40:46,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:40:46,390 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 166 [2018-11-12 20:40:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:46,392 INFO L225 Difference]: With dead ends: 179 [2018-11-12 20:40:46,392 INFO L226 Difference]: Without dead ends: 177 [2018-11-12 20:40:46,393 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 315 SyntacticMatches, 33 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:40:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-12 20:40:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-11-12 20:40:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-12 20:40:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-11-12 20:40:46,401 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 166 [2018-11-12 20:40:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:46,402 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-11-12 20:40:46,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:40:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-11-12 20:40:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-12 20:40:46,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:46,403 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:46,403 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:46,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:46,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1441002665, now seen corresponding path program 31 times [2018-11-12 20:40:46,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:46,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:46,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:46,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:46,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 560 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-12 20:40:47,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:47,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:47,284 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:47,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:47,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:47,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:47,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:47,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:47,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 560 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-12 20:40:48,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 560 proven. 272 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-12 20:40:48,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:48,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 54 [2018-11-12 20:40:48,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:48,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-12 20:40:48,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-12 20:40:48,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2018-11-12 20:40:48,608 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 54 states. [2018-11-12 20:40:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:49,725 INFO L93 Difference]: Finished difference Result 256 states and 274 transitions. [2018-11-12 20:40:49,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:40:49,725 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 174 [2018-11-12 20:40:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:49,726 INFO L225 Difference]: With dead ends: 256 [2018-11-12 20:40:49,727 INFO L226 Difference]: Without dead ends: 179 [2018-11-12 20:40:49,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 298 SyntacticMatches, 34 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1954 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1214, Invalid=3898, Unknown=0, NotChecked=0, Total=5112 [2018-11-12 20:40:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-12 20:40:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-11-12 20:40:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-12 20:40:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-11-12 20:40:49,739 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 174 [2018-11-12 20:40:49,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:49,739 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-11-12 20:40:49,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-12 20:40:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-11-12 20:40:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-12 20:40:49,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:49,741 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:49,741 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:49,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:49,741 INFO L82 PathProgramCache]: Analyzing trace with hash 98569489, now seen corresponding path program 32 times [2018-11-12 20:40:49,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:49,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:49,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:49,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:49,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 337 proven. 574 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-11-12 20:40:50,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:50,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:50,093 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:50,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:50,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:50,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:50,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:50,103 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:50,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-12 20:40:50,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:50,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 338 proven. 528 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-12 20:40:50,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 338 proven. 528 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-11-12 20:40:50,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:50,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 25 [2018-11-12 20:40:50,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:50,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:40:50,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:40:50,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:40:50,552 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 25 states. [2018-11-12 20:40:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:51,251 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-11-12 20:40:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:40:51,251 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 176 [2018-11-12 20:40:51,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:51,252 INFO L225 Difference]: With dead ends: 189 [2018-11-12 20:40:51,253 INFO L226 Difference]: Without dead ends: 187 [2018-11-12 20:40:51,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 334 SyntacticMatches, 35 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:40:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-12 20:40:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-11-12 20:40:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-12 20:40:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-11-12 20:40:51,262 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 176 [2018-11-12 20:40:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:51,262 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-11-12 20:40:51,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:40:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-11-12 20:40:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-12 20:40:51,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:51,264 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:51,264 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:51,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:51,264 INFO L82 PathProgramCache]: Analyzing trace with hash 785850677, now seen corresponding path program 33 times [2018-11-12 20:40:51,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:51,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:51,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:51,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:51,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 629 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-12 20:40:51,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:51,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:51,839 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:51,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:51,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:51,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:51,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:40:51,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:40:51,900 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:40:51,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:51,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 629 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-12 20:40:52,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 629 proven. 306 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-12 20:40:53,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:53,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 57 [2018-11-12 20:40:53,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:53,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-12 20:40:53,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-12 20:40:53,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=2433, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:40:53,247 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 57 states. [2018-11-12 20:40:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:54,308 INFO L93 Difference]: Finished difference Result 270 states and 289 transitions. [2018-11-12 20:40:54,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:40:54,309 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 184 [2018-11-12 20:40:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:54,310 INFO L225 Difference]: With dead ends: 270 [2018-11-12 20:40:54,310 INFO L226 Difference]: Without dead ends: 189 [2018-11-12 20:40:54,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 315 SyntacticMatches, 36 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2195 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1348, Invalid=4352, Unknown=0, NotChecked=0, Total=5700 [2018-11-12 20:40:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-12 20:40:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-11-12 20:40:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-12 20:40:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-11-12 20:40:54,320 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 184 [2018-11-12 20:40:54,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:54,321 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-11-12 20:40:54,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-12 20:40:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-11-12 20:40:54,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-12 20:40:54,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:54,324 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:54,324 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:54,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:54,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1200110993, now seen corresponding path program 34 times [2018-11-12 20:40:54,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:54,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:54,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:54,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:54,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 375 proven. 644 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-12 20:40:54,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:54,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:54,988 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:54,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:54,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:54,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:54,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:54,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:40:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:55,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 376 proven. 595 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-12 20:40:55,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1515 backedges. 376 proven. 595 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-12 20:40:55,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:55,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 26 [2018-11-12 20:40:55,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:55,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:40:55,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:40:55,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=428, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:40:55,475 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 26 states. [2018-11-12 20:40:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:55,779 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2018-11-12 20:40:55,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:40:55,779 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 186 [2018-11-12 20:40:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:55,781 INFO L225 Difference]: With dead ends: 199 [2018-11-12 20:40:55,781 INFO L226 Difference]: Without dead ends: 197 [2018-11-12 20:40:55,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 353 SyntacticMatches, 37 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=521, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:40:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-12 20:40:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-11-12 20:40:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-12 20:40:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-11-12 20:40:55,791 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 186 [2018-11-12 20:40:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:55,791 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-11-12 20:40:55,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:40:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-11-12 20:40:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-12 20:40:55,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:55,793 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:55,793 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:55,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:55,793 INFO L82 PathProgramCache]: Analyzing trace with hash 772446355, now seen corresponding path program 35 times [2018-11-12 20:40:55,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:55,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:55,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:40:55,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:55,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:40:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:40:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 702 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-12 20:40:56,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:56,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:40:56,605 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:40:56,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:40:56,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:40:56,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:40:56,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:40:56,614 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:40:56,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-11-12 20:40:56,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:40:56,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:40:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 702 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-12 20:40:58,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:40:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 702 proven. 342 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-12 20:40:58,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:40:58,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 60 [2018-11-12 20:40:58,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:40:58,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-11-12 20:40:58,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-11-12 20:40:58,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=2701, Unknown=0, NotChecked=0, Total=3540 [2018-11-12 20:40:58,749 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 60 states. [2018-11-12 20:40:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:40:59,974 INFO L93 Difference]: Finished difference Result 284 states and 304 transitions. [2018-11-12 20:40:59,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:40:59,974 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 194 [2018-11-12 20:40:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:40:59,975 INFO L225 Difference]: With dead ends: 284 [2018-11-12 20:40:59,975 INFO L226 Difference]: Without dead ends: 199 [2018-11-12 20:40:59,976 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 332 SyntacticMatches, 38 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1489, Invalid=4831, Unknown=0, NotChecked=0, Total=6320 [2018-11-12 20:40:59,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-12 20:40:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-11-12 20:40:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-12 20:40:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-11-12 20:40:59,986 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 194 [2018-11-12 20:40:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:40:59,986 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-11-12 20:40:59,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-11-12 20:40:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-11-12 20:40:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-12 20:40:59,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:40:59,988 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:40:59,988 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:40:59,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:40:59,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1075414707, now seen corresponding path program 36 times [2018-11-12 20:40:59,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:40:59,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:59,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:40:59,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:40:59,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 415 proven. 718 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-12 20:41:00,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:00,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:00,312 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:00,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:00,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:00,313 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:00,322 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:00,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:00,371 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:00,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:00,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 416 proven. 666 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-12 20:41:00,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 416 proven. 666 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2018-11-12 20:41:00,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:00,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 27 [2018-11-12 20:41:00,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:00,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:41:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:41:00,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:41:00,952 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 27 states. [2018-11-12 20:41:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:01,278 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-11-12 20:41:01,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:41:01,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 196 [2018-11-12 20:41:01,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:01,280 INFO L225 Difference]: With dead ends: 209 [2018-11-12 20:41:01,280 INFO L226 Difference]: Without dead ends: 207 [2018-11-12 20:41:01,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 372 SyntacticMatches, 39 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:41:01,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-12 20:41:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-11-12 20:41:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-12 20:41:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-11-12 20:41:01,288 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 196 [2018-11-12 20:41:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:01,288 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-11-12 20:41:01,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:41:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-11-12 20:41:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-12 20:41:01,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:01,290 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:01,290 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:01,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:01,291 INFO L82 PathProgramCache]: Analyzing trace with hash 565940593, now seen corresponding path program 37 times [2018-11-12 20:41:01,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:01,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:01,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:01,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 779 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-12 20:41:02,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:02,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:02,032 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:02,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:02,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:02,032 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:02,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:02,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:02,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 779 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-12 20:41:02,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1843 backedges. 779 proven. 380 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-12 20:41:03,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:03,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 63 [2018-11-12 20:41:03,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:03,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-11-12 20:41:03,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-11-12 20:41:03,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=923, Invalid=2983, Unknown=0, NotChecked=0, Total=3906 [2018-11-12 20:41:03,432 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 63 states. [2018-11-12 20:41:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:04,702 INFO L93 Difference]: Finished difference Result 298 states and 319 transitions. [2018-11-12 20:41:04,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:41:04,704 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 204 [2018-11-12 20:41:04,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:04,705 INFO L225 Difference]: With dead ends: 298 [2018-11-12 20:41:04,705 INFO L226 Difference]: Without dead ends: 209 [2018-11-12 20:41:04,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 349 SyntacticMatches, 40 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2719 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1637, Invalid=5335, Unknown=0, NotChecked=0, Total=6972 [2018-11-12 20:41:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-12 20:41:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-11-12 20:41:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-12 20:41:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-11-12 20:41:04,717 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 204 [2018-11-12 20:41:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:04,717 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-11-12 20:41:04,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-11-12 20:41:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-11-12 20:41:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-12 20:41:04,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:04,718 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:04,719 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:04,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:04,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1469492821, now seen corresponding path program 38 times [2018-11-12 20:41:04,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:04,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:04,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:04,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:04,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 457 proven. 796 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-11-12 20:41:05,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:05,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:05,339 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:05,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:05,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:05,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:05,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:05,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:05,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-12 20:41:05,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:05,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 458 proven. 741 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-12 20:41:05,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1883 backedges. 458 proven. 741 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2018-11-12 20:41:06,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:06,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 28 [2018-11-12 20:41:06,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:06,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:41:06,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:41:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=491, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:41:06,468 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 28 states. [2018-11-12 20:41:06,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:06,787 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-11-12 20:41:06,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:41:06,787 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 206 [2018-11-12 20:41:06,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:06,789 INFO L225 Difference]: With dead ends: 219 [2018-11-12 20:41:06,789 INFO L226 Difference]: Without dead ends: 217 [2018-11-12 20:41:06,789 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 391 SyntacticMatches, 41 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=278, Invalid=592, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:41:06,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-12 20:41:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-11-12 20:41:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-12 20:41:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-11-12 20:41:06,800 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 206 [2018-11-12 20:41:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:06,800 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-11-12 20:41:06,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:41:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-11-12 20:41:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-12 20:41:06,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:06,802 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:06,802 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:06,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:06,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1761137713, now seen corresponding path program 39 times [2018-11-12 20:41:06,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:06,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:06,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:06,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:06,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 860 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-12 20:41:08,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:08,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:08,218 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:08,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:08,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:08,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:08,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:08,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:08,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:08,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:08,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 860 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-12 20:41:09,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2040 backedges. 860 proven. 420 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-12 20:41:09,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:09,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 66 [2018-11-12 20:41:09,911 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:09,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-12 20:41:09,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-12 20:41:09,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1011, Invalid=3279, Unknown=0, NotChecked=0, Total=4290 [2018-11-12 20:41:09,913 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 66 states. [2018-11-12 20:41:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:11,949 INFO L93 Difference]: Finished difference Result 312 states and 334 transitions. [2018-11-12 20:41:11,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-12 20:41:11,949 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 214 [2018-11-12 20:41:11,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:11,950 INFO L225 Difference]: With dead ends: 312 [2018-11-12 20:41:11,950 INFO L226 Difference]: Without dead ends: 219 [2018-11-12 20:41:11,951 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 366 SyntacticMatches, 42 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3002 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1792, Invalid=5864, Unknown=0, NotChecked=0, Total=7656 [2018-11-12 20:41:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-12 20:41:11,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-11-12 20:41:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-12 20:41:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-11-12 20:41:11,961 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 214 [2018-11-12 20:41:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:11,961 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-11-12 20:41:11,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-12 20:41:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-11-12 20:41:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-12 20:41:11,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:11,963 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:11,963 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:11,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:11,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1420465271, now seen corresponding path program 40 times [2018-11-12 20:41:11,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:11,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:11,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:11,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:11,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 501 proven. 878 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-12 20:41:12,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:12,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:12,434 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:12,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:12,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:12,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:12,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:12,443 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:12,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 502 proven. 820 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-12 20:41:12,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2082 backedges. 502 proven. 820 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-12 20:41:13,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:13,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 29 [2018-11-12 20:41:13,048 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:13,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:41:13,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:41:13,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=524, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:41:13,049 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 29 states. [2018-11-12 20:41:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:13,309 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-11-12 20:41:13,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:41:13,310 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 216 [2018-11-12 20:41:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:13,311 INFO L225 Difference]: With dead ends: 229 [2018-11-12 20:41:13,312 INFO L226 Difference]: Without dead ends: 227 [2018-11-12 20:41:13,312 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 410 SyntacticMatches, 43 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=301, Invalid=629, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:41:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-12 20:41:13,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-11-12 20:41:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-12 20:41:13,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-11-12 20:41:13,323 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 216 [2018-11-12 20:41:13,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:13,324 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-11-12 20:41:13,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:41:13,324 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-11-12 20:41:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-12 20:41:13,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:13,325 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:13,325 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:13,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:13,326 INFO L82 PathProgramCache]: Analyzing trace with hash 807569325, now seen corresponding path program 41 times [2018-11-12 20:41:13,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:13,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:13,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:13,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:13,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 945 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-12 20:41:14,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:14,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:14,085 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:14,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:14,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:14,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:14,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:14,123 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:14,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-12 20:41:14,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:14,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 945 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-12 20:41:15,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2247 backedges. 945 proven. 462 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-12 20:41:15,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:15,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 69 [2018-11-12 20:41:15,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:15,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-12 20:41:15,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-12 20:41:15,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1103, Invalid=3589, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:41:15,788 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 69 states. [2018-11-12 20:41:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:17,642 INFO L93 Difference]: Finished difference Result 326 states and 349 transitions. [2018-11-12 20:41:17,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-12 20:41:17,642 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 224 [2018-11-12 20:41:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:17,644 INFO L225 Difference]: With dead ends: 326 [2018-11-12 20:41:17,644 INFO L226 Difference]: Without dead ends: 229 [2018-11-12 20:41:17,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 383 SyntacticMatches, 44 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3299 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1954, Invalid=6418, Unknown=0, NotChecked=0, Total=8372 [2018-11-12 20:41:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-12 20:41:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-11-12 20:41:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-12 20:41:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-11-12 20:41:17,655 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 224 [2018-11-12 20:41:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:17,655 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-11-12 20:41:17,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-12 20:41:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-11-12 20:41:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-12 20:41:17,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:17,657 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:17,657 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:17,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:17,658 INFO L82 PathProgramCache]: Analyzing trace with hash 823650023, now seen corresponding path program 42 times [2018-11-12 20:41:17,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:17,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:17,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:17,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:17,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 547 proven. 964 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-11-12 20:41:18,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:18,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:18,632 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:18,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:18,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:18,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:18,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:18,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:18,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:18,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:18,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 548 proven. 903 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-12 20:41:18,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2291 backedges. 548 proven. 903 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-11-12 20:41:19,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:19,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 30 [2018-11-12 20:41:19,310 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:19,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:41:19,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:41:19,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=558, Unknown=0, NotChecked=0, Total=870 [2018-11-12 20:41:19,311 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 30 states. [2018-11-12 20:41:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:19,620 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2018-11-12 20:41:19,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:41:19,620 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 226 [2018-11-12 20:41:19,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:19,622 INFO L225 Difference]: With dead ends: 239 [2018-11-12 20:41:19,622 INFO L226 Difference]: Without dead ends: 237 [2018-11-12 20:41:19,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 429 SyntacticMatches, 45 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=325, Invalid=667, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:41:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-12 20:41:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-11-12 20:41:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-12 20:41:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-11-12 20:41:19,634 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 226 [2018-11-12 20:41:19,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:19,634 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-11-12 20:41:19,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:41:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-11-12 20:41:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-12 20:41:19,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:19,636 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:19,636 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:19,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:19,637 INFO L82 PathProgramCache]: Analyzing trace with hash 643482891, now seen corresponding path program 43 times [2018-11-12 20:41:19,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:19,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:19,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:19,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:19,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1034 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-12 20:41:21,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:21,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:21,138 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:21,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:21,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:21,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:21,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:21,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:21,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1034 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-12 20:41:22,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 1034 proven. 506 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-12 20:41:23,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:23,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 72 [2018-11-12 20:41:23,241 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:23,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-11-12 20:41:23,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-11-12 20:41:23,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1199, Invalid=3913, Unknown=0, NotChecked=0, Total=5112 [2018-11-12 20:41:23,242 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 72 states. [2018-11-12 20:41:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:24,487 INFO L93 Difference]: Finished difference Result 340 states and 364 transitions. [2018-11-12 20:41:24,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-12 20:41:24,487 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 234 [2018-11-12 20:41:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:24,488 INFO L225 Difference]: With dead ends: 340 [2018-11-12 20:41:24,489 INFO L226 Difference]: Without dead ends: 239 [2018-11-12 20:41:24,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 400 SyntacticMatches, 46 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3610 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2123, Invalid=6997, Unknown=0, NotChecked=0, Total=9120 [2018-11-12 20:41:24,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-12 20:41:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-11-12 20:41:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-11-12 20:41:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-11-12 20:41:24,502 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 234 [2018-11-12 20:41:24,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:24,502 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-11-12 20:41:24,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-11-12 20:41:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-11-12 20:41:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-12 20:41:24,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:24,504 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:24,504 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:24,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:24,504 INFO L82 PathProgramCache]: Analyzing trace with hash -751443003, now seen corresponding path program 44 times [2018-11-12 20:41:24,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:24,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:24,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:24,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:24,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 595 proven. 1054 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-11-12 20:41:25,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:25,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:25,556 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:25,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:25,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:25,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:25,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:25,565 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:25,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-12 20:41:25,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:25,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 596 proven. 990 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-12 20:41:26,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 596 proven. 990 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2018-11-12 20:41:27,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:27,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 31 [2018-11-12 20:41:27,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:27,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:41:27,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:41:27,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=593, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:41:27,441 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 31 states. [2018-11-12 20:41:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:27,738 INFO L93 Difference]: Finished difference Result 249 states and 250 transitions. [2018-11-12 20:41:27,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 20:41:27,738 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 236 [2018-11-12 20:41:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:27,740 INFO L225 Difference]: With dead ends: 249 [2018-11-12 20:41:27,741 INFO L226 Difference]: Without dead ends: 247 [2018-11-12 20:41:27,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 448 SyntacticMatches, 47 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=350, Invalid=706, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:41:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-12 20:41:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-11-12 20:41:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-12 20:41:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-11-12 20:41:27,752 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 236 [2018-11-12 20:41:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:27,752 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-11-12 20:41:27,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:41:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-11-12 20:41:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-12 20:41:27,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:27,754 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:27,754 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:27,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:27,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1276445673, now seen corresponding path program 45 times [2018-11-12 20:41:27,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:27,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:27,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:27,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:27,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2691 backedges. 1127 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-12 20:41:28,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:28,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:28,900 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:28,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:28,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:28,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:28,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:28,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:28,981 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:28,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:28,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2691 backedges. 1127 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-12 20:41:29,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2691 backedges. 1127 proven. 552 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-12 20:41:31,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:31,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 75 [2018-11-12 20:41:31,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:31,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-11-12 20:41:31,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-11-12 20:41:31,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=4251, Unknown=0, NotChecked=0, Total=5550 [2018-11-12 20:41:31,024 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 75 states. [2018-11-12 20:41:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:32,874 INFO L93 Difference]: Finished difference Result 354 states and 379 transitions. [2018-11-12 20:41:32,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-12 20:41:32,874 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 244 [2018-11-12 20:41:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:32,876 INFO L225 Difference]: With dead ends: 354 [2018-11-12 20:41:32,876 INFO L226 Difference]: Without dead ends: 249 [2018-11-12 20:41:32,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 417 SyntacticMatches, 48 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3935 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2299, Invalid=7601, Unknown=0, NotChecked=0, Total=9900 [2018-11-12 20:41:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-12 20:41:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-11-12 20:41:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-12 20:41:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-11-12 20:41:32,889 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 244 [2018-11-12 20:41:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:32,890 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-11-12 20:41:32,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-11-12 20:41:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-11-12 20:41:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-12 20:41:32,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:32,891 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:32,892 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:32,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:32,892 INFO L82 PathProgramCache]: Analyzing trace with hash -565411293, now seen corresponding path program 46 times [2018-11-12 20:41:32,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:32,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:32,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:32,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:32,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:33,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 645 proven. 1148 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-11-12 20:41:33,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:33,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:33,364 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:33,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:33,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:33,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:33,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:33,372 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:33,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 646 proven. 1081 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-12 20:41:33,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 646 proven. 1081 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-12 20:41:34,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:34,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 32 [2018-11-12 20:41:34,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:34,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-12 20:41:34,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-12 20:41:34,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=629, Unknown=0, NotChecked=0, Total=992 [2018-11-12 20:41:34,136 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 32 states. [2018-11-12 20:41:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:34,426 INFO L93 Difference]: Finished difference Result 259 states and 260 transitions. [2018-11-12 20:41:34,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:41:34,427 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 246 [2018-11-12 20:41:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:34,428 INFO L225 Difference]: With dead ends: 259 [2018-11-12 20:41:34,429 INFO L226 Difference]: Without dead ends: 257 [2018-11-12 20:41:34,429 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 467 SyntacticMatches, 49 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=376, Invalid=746, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:41:34,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-12 20:41:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-11-12 20:41:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-12 20:41:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-11-12 20:41:34,440 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 246 [2018-11-12 20:41:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:34,441 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-11-12 20:41:34,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-12 20:41:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-11-12 20:41:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-11-12 20:41:34,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:34,442 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:34,443 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:34,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1899076537, now seen corresponding path program 47 times [2018-11-12 20:41:34,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:34,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:34,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 1224 proven. 600 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-12 20:41:35,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:35,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:35,393 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:35,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:35,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:35,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:35,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:35,402 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:35,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-11-12 20:41:35,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:35,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:36,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 1224 proven. 600 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-12 20:41:36,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 1224 proven. 600 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-12 20:41:37,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:37,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 78 [2018-11-12 20:41:37,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:37,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-11-12 20:41:37,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-11-12 20:41:37,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=4603, Unknown=0, NotChecked=0, Total=6006 [2018-11-12 20:41:37,766 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 78 states. [2018-11-12 20:41:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:39,643 INFO L93 Difference]: Finished difference Result 368 states and 394 transitions. [2018-11-12 20:41:39,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-12 20:41:39,643 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 254 [2018-11-12 20:41:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:39,644 INFO L225 Difference]: With dead ends: 368 [2018-11-12 20:41:39,645 INFO L226 Difference]: Without dead ends: 259 [2018-11-12 20:41:39,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 434 SyntacticMatches, 50 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4274 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2482, Invalid=8230, Unknown=0, NotChecked=0, Total=10712 [2018-11-12 20:41:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-12 20:41:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-11-12 20:41:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-12 20:41:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-11-12 20:41:39,657 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 254 [2018-11-12 20:41:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:39,657 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-11-12 20:41:39,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-11-12 20:41:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-11-12 20:41:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-12 20:41:39,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:39,659 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:39,659 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:39,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1410392577, now seen corresponding path program 48 times [2018-11-12 20:41:39,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:39,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:39,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:39,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:39,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2978 backedges. 697 proven. 1246 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-11-12 20:41:40,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:40,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:40,708 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:40,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:40,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:40,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:40,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:40,717 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:40,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:40,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:40,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2978 backedges. 698 proven. 1176 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-12 20:41:40,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2978 backedges. 698 proven. 1176 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2018-11-12 20:41:41,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:41,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 33 [2018-11-12 20:41:41,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:41,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:41:41,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:41:41,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=666, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:41:41,502 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 33 states. [2018-11-12 20:41:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:41,948 INFO L93 Difference]: Finished difference Result 269 states and 270 transitions. [2018-11-12 20:41:41,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 20:41:41,948 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 256 [2018-11-12 20:41:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:41,950 INFO L225 Difference]: With dead ends: 269 [2018-11-12 20:41:41,950 INFO L226 Difference]: Without dead ends: 267 [2018-11-12 20:41:41,950 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 486 SyntacticMatches, 51 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:41:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-12 20:41:41,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-11-12 20:41:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-12 20:41:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-11-12 20:41:41,962 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 256 [2018-11-12 20:41:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:41,962 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-11-12 20:41:41,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:41:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-11-12 20:41:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-12 20:41:41,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:41,964 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:41,964 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:41,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash -115603931, now seen corresponding path program 49 times [2018-11-12 20:41:41,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:41,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:41,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:41,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:41,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3175 backedges. 1325 proven. 650 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-12 20:41:43,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:43,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:43,081 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:43,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:43,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:43,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:43,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:43,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:43,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3175 backedges. 1325 proven. 650 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-12 20:41:44,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3175 backedges. 1325 proven. 650 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-12 20:41:45,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:45,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 81 [2018-11-12 20:41:45,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:45,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-11-12 20:41:45,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-11-12 20:41:45,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1511, Invalid=4969, Unknown=0, NotChecked=0, Total=6480 [2018-11-12 20:41:45,276 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 81 states. [2018-11-12 20:41:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:47,516 INFO L93 Difference]: Finished difference Result 382 states and 409 transitions. [2018-11-12 20:41:47,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-12 20:41:47,516 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 264 [2018-11-12 20:41:47,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:47,518 INFO L225 Difference]: With dead ends: 382 [2018-11-12 20:41:47,518 INFO L226 Difference]: Without dead ends: 269 [2018-11-12 20:41:47,520 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 451 SyntacticMatches, 52 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4627 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2672, Invalid=8884, Unknown=0, NotChecked=0, Total=11556 [2018-11-12 20:41:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-11-12 20:41:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-11-12 20:41:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-12 20:41:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-11-12 20:41:47,533 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 264 [2018-11-12 20:41:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:47,533 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-11-12 20:41:47,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-11-12 20:41:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-11-12 20:41:47,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-12 20:41:47,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:47,535 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:47,535 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:47,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:47,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1833968479, now seen corresponding path program 50 times [2018-11-12 20:41:47,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:47,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:47,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:47,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:47,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 751 proven. 1348 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-11-12 20:41:48,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:48,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:48,061 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:48,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:48,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:48,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:48,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:48,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:48,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-12 20:41:48,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:48,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 752 proven. 1275 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-12 20:41:48,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:49,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3227 backedges. 752 proven. 1275 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-12 20:41:49,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:49,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 34 [2018-11-12 20:41:49,197 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:49,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:41:49,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:41:49,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=704, Unknown=0, NotChecked=0, Total=1122 [2018-11-12 20:41:49,198 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 34 states. [2018-11-12 20:41:49,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:49,560 INFO L93 Difference]: Finished difference Result 279 states and 280 transitions. [2018-11-12 20:41:49,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 20:41:49,561 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 266 [2018-11-12 20:41:49,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:49,563 INFO L225 Difference]: With dead ends: 279 [2018-11-12 20:41:49,563 INFO L226 Difference]: Without dead ends: 277 [2018-11-12 20:41:49,564 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 505 SyntacticMatches, 53 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=431, Invalid=829, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:41:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-12 20:41:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-11-12 20:41:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-12 20:41:49,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-11-12 20:41:49,575 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 266 [2018-11-12 20:41:49,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:49,575 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-11-12 20:41:49,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:41:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-11-12 20:41:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-12 20:41:49,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:49,577 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:49,577 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:49,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:49,578 INFO L82 PathProgramCache]: Analyzing trace with hash 883624323, now seen corresponding path program 51 times [2018-11-12 20:41:49,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:49,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:49,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:49,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:49,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1430 proven. 702 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-12 20:41:50,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:50,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:50,662 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:50,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:50,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:50,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:50,671 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:41:50,671 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:41:50,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:41:50,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:50,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1430 proven. 702 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-12 20:41:52,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1430 proven. 702 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-12 20:41:53,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:53,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 84 [2018-11-12 20:41:53,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:53,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-11-12 20:41:53,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-11-12 20:41:53,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1623, Invalid=5349, Unknown=0, NotChecked=0, Total=6972 [2018-11-12 20:41:53,322 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 84 states. [2018-11-12 20:41:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:54,649 INFO L93 Difference]: Finished difference Result 396 states and 424 transitions. [2018-11-12 20:41:54,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-12 20:41:54,649 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 274 [2018-11-12 20:41:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:54,651 INFO L225 Difference]: With dead ends: 396 [2018-11-12 20:41:54,651 INFO L226 Difference]: Without dead ends: 279 [2018-11-12 20:41:54,652 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 468 SyntacticMatches, 54 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4994 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2869, Invalid=9563, Unknown=0, NotChecked=0, Total=12432 [2018-11-12 20:41:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-12 20:41:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-11-12 20:41:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-12 20:41:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-11-12 20:41:54,664 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 274 [2018-11-12 20:41:54,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:54,664 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-11-12 20:41:54,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-11-12 20:41:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-11-12 20:41:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-11-12 20:41:54,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:54,666 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:54,666 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:54,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:54,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1678809539, now seen corresponding path program 52 times [2018-11-12 20:41:54,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:54,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:54,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:41:54,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:54,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 807 proven. 1454 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-11-12 20:41:55,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:55,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:55,227 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:55,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:55,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:55,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:55,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:55,238 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:41:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:55,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 808 proven. 1378 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-12 20:41:55,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:41:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 808 proven. 1378 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-11-12 20:41:56,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:41:56,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 35 [2018-11-12 20:41:56,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:41:56,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:41:56,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:41:56,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=743, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:41:56,165 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 35 states. [2018-11-12 20:41:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:41:56,551 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2018-11-12 20:41:56,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 20:41:56,551 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 276 [2018-11-12 20:41:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:41:56,553 INFO L225 Difference]: With dead ends: 289 [2018-11-12 20:41:56,553 INFO L226 Difference]: Without dead ends: 287 [2018-11-12 20:41:56,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 524 SyntacticMatches, 55 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=460, Invalid=872, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:41:56,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-11-12 20:41:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-11-12 20:41:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-11-12 20:41:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-11-12 20:41:56,563 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 276 [2018-11-12 20:41:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:41:56,563 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-11-12 20:41:56,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:41:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-11-12 20:41:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-12 20:41:56,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:41:56,565 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:41:56,565 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:41:56,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:41:56,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1941926303, now seen corresponding path program 53 times [2018-11-12 20:41:56,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:41:56,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:56,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:41:56,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:41:56,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:41:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:41:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 1539 proven. 756 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-12 20:41:57,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:57,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:41:57,975 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:41:57,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:41:57,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:41:57,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:41:57,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:41:57,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:41:58,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-12 20:41:58,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:41:58,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:41:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 1539 proven. 756 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-12 20:41:59,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3699 backedges. 1539 proven. 756 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-12 20:42:00,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:00,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 87 [2018-11-12 20:42:00,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:00,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-11-12 20:42:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-11-12 20:42:00,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1739, Invalid=5743, Unknown=0, NotChecked=0, Total=7482 [2018-11-12 20:42:00,548 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 87 states. [2018-11-12 20:42:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:01,820 INFO L93 Difference]: Finished difference Result 410 states and 439 transitions. [2018-11-12 20:42:01,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-12 20:42:01,820 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 284 [2018-11-12 20:42:01,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:01,822 INFO L225 Difference]: With dead ends: 410 [2018-11-12 20:42:01,822 INFO L226 Difference]: Without dead ends: 289 [2018-11-12 20:42:01,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 485 SyntacticMatches, 56 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5375 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3073, Invalid=10267, Unknown=0, NotChecked=0, Total=13340 [2018-11-12 20:42:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-12 20:42:01,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-11-12 20:42:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-12 20:42:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-11-12 20:42:01,837 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 284 [2018-11-12 20:42:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:01,837 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-11-12 20:42:01,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-11-12 20:42:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-11-12 20:42:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-12 20:42:01,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:01,839 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:01,839 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:01,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:01,840 INFO L82 PathProgramCache]: Analyzing trace with hash 216779419, now seen corresponding path program 54 times [2018-11-12 20:42:01,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:01,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:01,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:01,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:01,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3755 backedges. 865 proven. 1564 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-11-12 20:42:02,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:02,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:02,575 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:02,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:02,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:02,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:02,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:02,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:02,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:02,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:02,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3755 backedges. 866 proven. 1485 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-12 20:42:02,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3755 backedges. 866 proven. 1485 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2018-11-12 20:42:03,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:03,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 36 [2018-11-12 20:42:03,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:03,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:42:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:42:03,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=783, Unknown=0, NotChecked=0, Total=1260 [2018-11-12 20:42:03,533 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 36 states. [2018-11-12 20:42:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:03,891 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-11-12 20:42:03,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:42:03,892 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 286 [2018-11-12 20:42:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:03,894 INFO L225 Difference]: With dead ends: 299 [2018-11-12 20:42:03,894 INFO L226 Difference]: Without dead ends: 297 [2018-11-12 20:42:03,894 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 543 SyntacticMatches, 57 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=490, Invalid=916, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:42:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-12 20:42:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-11-12 20:42:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-12 20:42:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-11-12 20:42:03,907 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 286 [2018-11-12 20:42:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:03,907 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-11-12 20:42:03,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:42:03,908 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-11-12 20:42:03,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-12 20:42:03,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:03,909 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:03,910 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:03,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:03,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1840886975, now seen corresponding path program 55 times [2018-11-12 20:42:03,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:03,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:03,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:03,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:03,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1652 proven. 812 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-12 20:42:05,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:05,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:05,257 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:05,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:05,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:05,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:05,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:05,267 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:05,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1652 proven. 812 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-12 20:42:06,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1652 proven. 812 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-12 20:42:08,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:08,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 90 [2018-11-12 20:42:08,296 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:08,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-11-12 20:42:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-11-12 20:42:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1859, Invalid=6151, Unknown=0, NotChecked=0, Total=8010 [2018-11-12 20:42:08,297 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 90 states. [2018-11-12 20:42:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:10,196 INFO L93 Difference]: Finished difference Result 424 states and 454 transitions. [2018-11-12 20:42:10,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-12 20:42:10,197 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 294 [2018-11-12 20:42:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:10,198 INFO L225 Difference]: With dead ends: 424 [2018-11-12 20:42:10,198 INFO L226 Difference]: Without dead ends: 299 [2018-11-12 20:42:10,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 502 SyntacticMatches, 58 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5770 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3284, Invalid=10996, Unknown=0, NotChecked=0, Total=14280 [2018-11-12 20:42:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-12 20:42:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-11-12 20:42:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-12 20:42:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-11-12 20:42:10,212 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 294 [2018-11-12 20:42:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:10,213 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-11-12 20:42:10,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-11-12 20:42:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-11-12 20:42:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-12 20:42:10,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:10,215 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:10,215 INFO L423 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:10,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1436913543, now seen corresponding path program 56 times [2018-11-12 20:42:10,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:10,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:10,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:10,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:10,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4034 backedges. 925 proven. 1678 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-11-12 20:42:11,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:11,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:11,125 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:11,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:11,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:11,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:11,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:11,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:11,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-12 20:42:11,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:11,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4034 backedges. 926 proven. 1596 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-12 20:42:11,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4034 backedges. 926 proven. 1596 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2018-11-12 20:42:12,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:12,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 37 [2018-11-12 20:42:12,202 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:12,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:42:12,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:42:12,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=824, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:42:12,203 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 37 states. [2018-11-12 20:42:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:12,725 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2018-11-12 20:42:12,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-12 20:42:12,726 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 296 [2018-11-12 20:42:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:12,728 INFO L225 Difference]: With dead ends: 309 [2018-11-12 20:42:12,728 INFO L226 Difference]: Without dead ends: 307 [2018-11-12 20:42:12,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 562 SyntacticMatches, 59 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=521, Invalid=961, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:42:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-12 20:42:12,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-11-12 20:42:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-12 20:42:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-11-12 20:42:12,739 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 296 [2018-11-12 20:42:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:12,739 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-11-12 20:42:12,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:42:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-11-12 20:42:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-12 20:42:12,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:12,741 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:12,741 INFO L423 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:12,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:12,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1812700317, now seen corresponding path program 57 times [2018-11-12 20:42:12,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:12,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:12,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:12,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:12,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1769 proven. 870 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-12 20:42:14,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:14,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:14,031 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:14,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:14,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:14,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:14,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:14,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:14,125 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:14,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:14,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1769 proven. 870 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-12 20:42:15,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 1769 proven. 870 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-12 20:42:16,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:16,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 93 [2018-11-12 20:42:16,800 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:16,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-11-12 20:42:16,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-11-12 20:42:16,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1983, Invalid=6573, Unknown=0, NotChecked=0, Total=8556 [2018-11-12 20:42:16,802 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 93 states. [2018-11-12 20:42:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:18,968 INFO L93 Difference]: Finished difference Result 438 states and 469 transitions. [2018-11-12 20:42:18,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-12 20:42:18,968 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 304 [2018-11-12 20:42:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:18,969 INFO L225 Difference]: With dead ends: 438 [2018-11-12 20:42:18,969 INFO L226 Difference]: Without dead ends: 309 [2018-11-12 20:42:18,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 519 SyntacticMatches, 60 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6179 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3502, Invalid=11750, Unknown=0, NotChecked=0, Total=15252 [2018-11-12 20:42:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-11-12 20:42:18,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-11-12 20:42:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-12 20:42:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-11-12 20:42:18,982 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 304 [2018-11-12 20:42:18,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:18,983 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-11-12 20:42:18,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-11-12 20:42:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-11-12 20:42:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-12 20:42:18,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:18,985 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:18,985 INFO L423 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:18,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:18,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1654097961, now seen corresponding path program 58 times [2018-11-12 20:42:18,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:18,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:18,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:18,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:18,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 987 proven. 1796 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-11-12 20:42:19,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:19,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:19,625 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:19,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:19,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:19,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:19,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:19,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 988 proven. 1711 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-12 20:42:19,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4323 backedges. 988 proven. 1711 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2018-11-12 20:42:20,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:20,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 38 [2018-11-12 20:42:20,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:20,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-12 20:42:20,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-12 20:42:20,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=866, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:42:20,675 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 38 states. [2018-11-12 20:42:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:21,116 INFO L93 Difference]: Finished difference Result 319 states and 320 transitions. [2018-11-12 20:42:21,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:42:21,117 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 306 [2018-11-12 20:42:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:21,119 INFO L225 Difference]: With dead ends: 319 [2018-11-12 20:42:21,119 INFO L226 Difference]: Without dead ends: 317 [2018-11-12 20:42:21,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 581 SyntacticMatches, 61 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=553, Invalid=1007, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:42:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-11-12 20:42:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-11-12 20:42:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-12 20:42:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 318 transitions. [2018-11-12 20:42:21,132 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 318 transitions. Word has length 306 [2018-11-12 20:42:21,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:21,132 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 318 transitions. [2018-11-12 20:42:21,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-12 20:42:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 318 transitions. [2018-11-12 20:42:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-12 20:42:21,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:21,134 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:21,134 INFO L423 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:21,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:21,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1052547589, now seen corresponding path program 59 times [2018-11-12 20:42:21,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:21,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:21,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:21,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:21,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 1890 proven. 930 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-12 20:42:22,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:22,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:22,655 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:22,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:22,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:22,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:22,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:22,665 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:22,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-11-12 20:42:22,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:22,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 1890 proven. 930 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-12 20:42:24,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 1890 proven. 930 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-12 20:42:26,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:26,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 96 [2018-11-12 20:42:26,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:26,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-12 20:42:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-12 20:42:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=7009, Unknown=0, NotChecked=0, Total=9120 [2018-11-12 20:42:26,011 INFO L87 Difference]: Start difference. First operand 317 states and 318 transitions. Second operand 96 states. [2018-11-12 20:42:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:28,229 INFO L93 Difference]: Finished difference Result 452 states and 484 transitions. [2018-11-12 20:42:28,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-12 20:42:28,229 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 314 [2018-11-12 20:42:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:28,230 INFO L225 Difference]: With dead ends: 452 [2018-11-12 20:42:28,230 INFO L226 Difference]: Without dead ends: 319 [2018-11-12 20:42:28,232 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 536 SyntacticMatches, 62 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6602 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3727, Invalid=12529, Unknown=0, NotChecked=0, Total=16256 [2018-11-12 20:42:28,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-12 20:42:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-11-12 20:42:28,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-11-12 20:42:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-11-12 20:42:28,242 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 314 [2018-11-12 20:42:28,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:28,242 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-11-12 20:42:28,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-11-12 20:42:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-11-12 20:42:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-11-12 20:42:28,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:28,243 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:28,244 INFO L423 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:28,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:28,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1348141237, now seen corresponding path program 60 times [2018-11-12 20:42:28,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:28,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:28,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:28,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:28,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4622 backedges. 1051 proven. 1918 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-11-12 20:42:28,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:28,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:28,927 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:28,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:28,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:28,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:28,937 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:28,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:29,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:29,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:29,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4622 backedges. 1052 proven. 1830 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-12 20:42:29,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4622 backedges. 1052 proven. 1830 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-11-12 20:42:30,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:30,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 39 [2018-11-12 20:42:30,250 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:30,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:42:30,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:42:30,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=909, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:42:30,251 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 39 states. [2018-11-12 20:42:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:30,761 INFO L93 Difference]: Finished difference Result 329 states and 330 transitions. [2018-11-12 20:42:30,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-12 20:42:30,761 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 316 [2018-11-12 20:42:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:30,763 INFO L225 Difference]: With dead ends: 329 [2018-11-12 20:42:30,763 INFO L226 Difference]: Without dead ends: 327 [2018-11-12 20:42:30,764 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 600 SyntacticMatches, 63 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=586, Invalid=1054, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:42:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-12 20:42:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-11-12 20:42:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-11-12 20:42:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-11-12 20:42:30,773 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 316 [2018-11-12 20:42:30,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:30,774 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-11-12 20:42:30,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:42:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-11-12 20:42:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-11-12 20:42:30,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:30,775 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:30,775 INFO L423 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:30,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:30,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1350971609, now seen corresponding path program 61 times [2018-11-12 20:42:30,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:30,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:30,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4867 backedges. 2015 proven. 992 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-12 20:42:32,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:32,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:32,223 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:32,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:32,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:32,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:32,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:32,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:32,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4867 backedges. 2015 proven. 992 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-12 20:42:34,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4867 backedges. 2015 proven. 992 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-12 20:42:35,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:35,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 99 [2018-11-12 20:42:35,833 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:35,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-11-12 20:42:35,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-11-12 20:42:35,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2243, Invalid=7459, Unknown=0, NotChecked=0, Total=9702 [2018-11-12 20:42:35,835 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 99 states. [2018-11-12 20:42:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:38,267 INFO L93 Difference]: Finished difference Result 466 states and 499 transitions. [2018-11-12 20:42:38,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-11-12 20:42:38,268 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 324 [2018-11-12 20:42:38,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:38,269 INFO L225 Difference]: With dead ends: 466 [2018-11-12 20:42:38,269 INFO L226 Difference]: Without dead ends: 329 [2018-11-12 20:42:38,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 553 SyntacticMatches, 64 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7039 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3959, Invalid=13333, Unknown=0, NotChecked=0, Total=17292 [2018-11-12 20:42:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-12 20:42:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-11-12 20:42:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-12 20:42:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-11-12 20:42:38,284 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 324 [2018-11-12 20:42:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:38,284 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-11-12 20:42:38,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-11-12 20:42:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-11-12 20:42:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-11-12 20:42:38,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:38,286 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:38,286 INFO L423 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:38,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:38,287 INFO L82 PathProgramCache]: Analyzing trace with hash -259052781, now seen corresponding path program 62 times [2018-11-12 20:42:38,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:38,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:38,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:38,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:38,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4931 backedges. 1117 proven. 2044 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-11-12 20:42:38,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:38,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:38,988 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:38,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:38,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:38,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:38,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:38,999 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:39,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-12 20:42:39,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:39,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4931 backedges. 1118 proven. 1953 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-12 20:42:39,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4931 backedges. 1118 proven. 1953 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-12 20:42:40,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:40,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 40 [2018-11-12 20:42:40,195 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:40,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:42:40,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:42:40,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=953, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:42:40,196 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 40 states. [2018-11-12 20:42:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:40,613 INFO L93 Difference]: Finished difference Result 339 states and 340 transitions. [2018-11-12 20:42:40,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:42:40,614 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 326 [2018-11-12 20:42:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:40,616 INFO L225 Difference]: With dead ends: 339 [2018-11-12 20:42:40,616 INFO L226 Difference]: Without dead ends: 337 [2018-11-12 20:42:40,617 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 619 SyntacticMatches, 65 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=620, Invalid=1102, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:42:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-12 20:42:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-11-12 20:42:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-12 20:42:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-11-12 20:42:40,632 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 326 [2018-11-12 20:42:40,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:40,632 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-11-12 20:42:40,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-12 20:42:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-11-12 20:42:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-11-12 20:42:40,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:40,635 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:40,635 INFO L423 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:40,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:40,635 INFO L82 PathProgramCache]: Analyzing trace with hash 672210231, now seen corresponding path program 63 times [2018-11-12 20:42:40,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:40,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:40,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:40,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:40,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2144 proven. 1056 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-12 20:42:42,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:42,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:42,240 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:42,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:42,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:42,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:42,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:42,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:42,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:42,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:42,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2144 proven. 1056 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-12 20:42:44,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:45,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2144 proven. 1056 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-12 20:42:45,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:45,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 102 [2018-11-12 20:42:45,925 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:45,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-11-12 20:42:45,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-11-12 20:42:45,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2379, Invalid=7923, Unknown=0, NotChecked=0, Total=10302 [2018-11-12 20:42:45,926 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 102 states. [2018-11-12 20:42:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:48,158 INFO L93 Difference]: Finished difference Result 480 states and 514 transitions. [2018-11-12 20:42:48,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-12 20:42:48,159 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 334 [2018-11-12 20:42:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:48,160 INFO L225 Difference]: With dead ends: 480 [2018-11-12 20:42:48,160 INFO L226 Difference]: Without dead ends: 339 [2018-11-12 20:42:48,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 570 SyntacticMatches, 66 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7490 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4198, Invalid=14162, Unknown=0, NotChecked=0, Total=18360 [2018-11-12 20:42:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-12 20:42:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-11-12 20:42:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-11-12 20:42:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-11-12 20:42:48,172 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 334 [2018-11-12 20:42:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:48,172 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-11-12 20:42:48,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-11-12 20:42:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-11-12 20:42:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-11-12 20:42:48,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:48,173 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:48,174 INFO L423 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:48,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1887049457, now seen corresponding path program 64 times [2018-11-12 20:42:48,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:48,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:48,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:48,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 1185 proven. 2174 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-11-12 20:42:49,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:49,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:49,145 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:49,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:49,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:49,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:49,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:49,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:42:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:49,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 1186 proven. 2080 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-12 20:42:49,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 1186 proven. 2080 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2018-11-12 20:42:50,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:50,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 41 [2018-11-12 20:42:50,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:50,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:42:50,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:42:50,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=998, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:42:50,374 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 41 states. [2018-11-12 20:42:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:50,858 INFO L93 Difference]: Finished difference Result 349 states and 350 transitions. [2018-11-12 20:42:50,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-12 20:42:50,859 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 336 [2018-11-12 20:42:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:50,861 INFO L225 Difference]: With dead ends: 349 [2018-11-12 20:42:50,861 INFO L226 Difference]: Without dead ends: 347 [2018-11-12 20:42:50,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 638 SyntacticMatches, 67 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=655, Invalid=1151, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:42:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-12 20:42:50,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-11-12 20:42:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-11-12 20:42:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-11-12 20:42:50,875 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 336 [2018-11-12 20:42:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:50,875 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-11-12 20:42:50,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-12 20:42:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-11-12 20:42:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-11-12 20:42:50,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:50,878 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:50,878 INFO L423 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:50,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:50,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2093397227, now seen corresponding path program 65 times [2018-11-12 20:42:50,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:50,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:50,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:42:50,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:50,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5511 backedges. 2277 proven. 1122 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-12 20:42:52,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:52,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:52,697 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:52,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:52,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:52,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:52,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:42:52,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:42:52,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-12 20:42:52,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:52,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:42:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5511 backedges. 2277 proven. 1122 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-12 20:42:55,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:42:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5511 backedges. 2277 proven. 1122 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-12 20:42:56,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:42:56,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 105 [2018-11-12 20:42:56,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:42:56,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-11-12 20:42:56,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-11-12 20:42:56,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2519, Invalid=8401, Unknown=0, NotChecked=0, Total=10920 [2018-11-12 20:42:56,572 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 105 states. [2018-11-12 20:42:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:42:59,169 INFO L93 Difference]: Finished difference Result 494 states and 529 transitions. [2018-11-12 20:42:59,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-12 20:42:59,169 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 344 [2018-11-12 20:42:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:42:59,171 INFO L225 Difference]: With dead ends: 494 [2018-11-12 20:42:59,171 INFO L226 Difference]: Without dead ends: 349 [2018-11-12 20:42:59,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 587 SyntacticMatches, 68 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7955 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4444, Invalid=15016, Unknown=0, NotChecked=0, Total=19460 [2018-11-12 20:42:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-12 20:42:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-11-12 20:42:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-11-12 20:42:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-11-12 20:42:59,184 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 344 [2018-11-12 20:42:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:42:59,184 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-11-12 20:42:59,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-11-12 20:42:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-11-12 20:42:59,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-12 20:42:59,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:42:59,186 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:42:59,186 INFO L423 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:42:59,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:42:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash 162063439, now seen corresponding path program 66 times [2018-11-12 20:42:59,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:42:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:59,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:42:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:42:59,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:42:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:42:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5579 backedges. 1255 proven. 2308 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-11-12 20:42:59,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:59,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:42:59,862 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:42:59,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:42:59,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:42:59,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:42:59,874 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:42:59,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:42:59,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:42:59,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:42:59,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5579 backedges. 1256 proven. 2211 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-12 20:43:00,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5579 backedges. 1256 proven. 2211 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2018-11-12 20:43:01,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:01,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 42 [2018-11-12 20:43:01,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:01,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:43:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:43:01,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=678, Invalid=1044, Unknown=0, NotChecked=0, Total=1722 [2018-11-12 20:43:01,176 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 42 states. [2018-11-12 20:43:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:01,607 INFO L93 Difference]: Finished difference Result 359 states and 360 transitions. [2018-11-12 20:43:01,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:43:01,608 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 346 [2018-11-12 20:43:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:01,610 INFO L225 Difference]: With dead ends: 359 [2018-11-12 20:43:01,610 INFO L226 Difference]: Without dead ends: 357 [2018-11-12 20:43:01,611 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 657 SyntacticMatches, 69 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=691, Invalid=1201, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:43:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-11-12 20:43:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-11-12 20:43:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-11-12 20:43:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-11-12 20:43:01,622 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 346 [2018-11-12 20:43:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:01,622 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-11-12 20:43:01,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:43:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-11-12 20:43:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-12 20:43:01,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:01,625 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:01,625 INFO L423 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:01,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1282136691, now seen corresponding path program 67 times [2018-11-12 20:43:01,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:01,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:01,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:01,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:01,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 2414 proven. 1190 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-12 20:43:03,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:03,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:03,345 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:03,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:03,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:03,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:03,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:03,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:03,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 2414 proven. 1190 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-12 20:43:05,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5848 backedges. 2414 proven. 1190 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-12 20:43:07,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:07,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 108 [2018-11-12 20:43:07,419 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:07,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-11-12 20:43:07,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-11-12 20:43:07,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2663, Invalid=8893, Unknown=0, NotChecked=0, Total=11556 [2018-11-12 20:43:07,421 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 108 states. [2018-11-12 20:43:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:10,229 INFO L93 Difference]: Finished difference Result 508 states and 544 transitions. [2018-11-12 20:43:10,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-11-12 20:43:10,229 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 354 [2018-11-12 20:43:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:10,231 INFO L225 Difference]: With dead ends: 508 [2018-11-12 20:43:10,231 INFO L226 Difference]: Without dead ends: 359 [2018-11-12 20:43:10,233 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 604 SyntacticMatches, 70 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8434 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4697, Invalid=15895, Unknown=0, NotChecked=0, Total=20592 [2018-11-12 20:43:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-11-12 20:43:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-11-12 20:43:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-11-12 20:43:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-11-12 20:43:10,246 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 354 [2018-11-12 20:43:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:10,246 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-11-12 20:43:10,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-11-12 20:43:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-11-12 20:43:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-11-12 20:43:10,248 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:10,248 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:10,248 INFO L423 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:10,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1052816173, now seen corresponding path program 68 times [2018-11-12 20:43:10,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:10,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:10,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:10,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:10,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5918 backedges. 1327 proven. 2446 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-11-12 20:43:11,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:11,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:11,114 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:11,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:11,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:11,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:11,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:11,122 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:11,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-12 20:43:11,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:11,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5918 backedges. 1328 proven. 2346 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-12 20:43:11,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5918 backedges. 1328 proven. 2346 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2018-11-12 20:43:12,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:12,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 43 [2018-11-12 20:43:12,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:12,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-12 20:43:12,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-12 20:43:12,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=1091, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:43:12,492 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 43 states. [2018-11-12 20:43:13,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:13,006 INFO L93 Difference]: Finished difference Result 369 states and 370 transitions. [2018-11-12 20:43:13,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-12 20:43:13,007 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 356 [2018-11-12 20:43:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:13,009 INFO L225 Difference]: With dead ends: 369 [2018-11-12 20:43:13,009 INFO L226 Difference]: Without dead ends: 367 [2018-11-12 20:43:13,009 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 676 SyntacticMatches, 71 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=728, Invalid=1252, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:43:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-12 20:43:13,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-11-12 20:43:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-12 20:43:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-11-12 20:43:13,020 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 356 [2018-11-12 20:43:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:13,020 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-11-12 20:43:13,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-12 20:43:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-11-12 20:43:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-11-12 20:43:13,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:13,022 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:13,022 INFO L423 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:13,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:13,022 INFO L82 PathProgramCache]: Analyzing trace with hash 523103057, now seen corresponding path program 69 times [2018-11-12 20:43:13,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:13,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:13,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:13,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:13,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 2555 proven. 1260 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-12 20:43:15,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:15,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:15,077 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:15,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:15,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:15,077 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:15,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:15,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:15,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:15,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:15,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 2555 proven. 1260 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-12 20:43:17,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 2555 proven. 1260 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-12 20:43:18,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:18,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 111 [2018-11-12 20:43:18,997 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:18,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-11-12 20:43:18,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-11-12 20:43:18,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2811, Invalid=9399, Unknown=0, NotChecked=0, Total=12210 [2018-11-12 20:43:18,998 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 111 states. [2018-11-12 20:43:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:21,840 INFO L93 Difference]: Finished difference Result 522 states and 559 transitions. [2018-11-12 20:43:21,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-12 20:43:21,840 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 364 [2018-11-12 20:43:21,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:21,842 INFO L225 Difference]: With dead ends: 522 [2018-11-12 20:43:21,842 INFO L226 Difference]: Without dead ends: 369 [2018-11-12 20:43:21,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 621 SyntacticMatches, 72 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8927 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4957, Invalid=16799, Unknown=0, NotChecked=0, Total=21756 [2018-11-12 20:43:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-12 20:43:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-11-12 20:43:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-12 20:43:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-11-12 20:43:21,860 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 364 [2018-11-12 20:43:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:21,861 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-11-12 20:43:21,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-11-12 20:43:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-11-12 20:43:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-11-12 20:43:21,863 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:21,863 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:21,863 INFO L423 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:21,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:21,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1568580491, now seen corresponding path program 70 times [2018-11-12 20:43:21,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:21,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:21,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:21,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:21,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6267 backedges. 1401 proven. 2588 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-11-12 20:43:22,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:22,619 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:22,619 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:22,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:22,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:22,619 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:22,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:22,627 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:22,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6267 backedges. 1402 proven. 2485 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-12 20:43:22,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6267 backedges. 1402 proven. 2485 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2018-11-12 20:43:24,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:24,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 44 [2018-11-12 20:43:24,057 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:24,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-12 20:43:24,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-12 20:43:24,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=753, Invalid=1139, Unknown=0, NotChecked=0, Total=1892 [2018-11-12 20:43:24,058 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 44 states. [2018-11-12 20:43:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:24,716 INFO L93 Difference]: Finished difference Result 379 states and 380 transitions. [2018-11-12 20:43:24,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:43:24,717 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 366 [2018-11-12 20:43:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:24,719 INFO L225 Difference]: With dead ends: 379 [2018-11-12 20:43:24,719 INFO L226 Difference]: Without dead ends: 377 [2018-11-12 20:43:24,719 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 695 SyntacticMatches, 73 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=766, Invalid=1304, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:43:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-11-12 20:43:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-11-12 20:43:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-11-12 20:43:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-11-12 20:43:24,734 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 366 [2018-11-12 20:43:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:24,734 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-11-12 20:43:24,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-12 20:43:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-11-12 20:43:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-11-12 20:43:24,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:24,736 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:24,736 INFO L423 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:24,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash -904094289, now seen corresponding path program 71 times [2018-11-12 20:43:24,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:24,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:24,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:24,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:24,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 2700 proven. 1332 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-12 20:43:26,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:26,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:26,561 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:26,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:26,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:26,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:26,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:26,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:26,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-11-12 20:43:26,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:26,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 2700 proven. 1332 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-12 20:43:28,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:30,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6552 backedges. 2700 proven. 1332 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-12 20:43:30,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:30,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 114 [2018-11-12 20:43:30,969 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:30,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-11-12 20:43:30,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-11-12 20:43:30,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2963, Invalid=9919, Unknown=0, NotChecked=0, Total=12882 [2018-11-12 20:43:30,971 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 114 states. [2018-11-12 20:43:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:33,833 INFO L93 Difference]: Finished difference Result 536 states and 574 transitions. [2018-11-12 20:43:33,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-11-12 20:43:33,834 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 374 [2018-11-12 20:43:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:33,835 INFO L225 Difference]: With dead ends: 536 [2018-11-12 20:43:33,835 INFO L226 Difference]: Without dead ends: 379 [2018-11-12 20:43:33,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 638 SyntacticMatches, 74 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9434 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5224, Invalid=17728, Unknown=0, NotChecked=0, Total=22952 [2018-11-12 20:43:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-12 20:43:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-12 20:43:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-12 20:43:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 380 transitions. [2018-11-12 20:43:33,850 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 380 transitions. Word has length 374 [2018-11-12 20:43:33,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:33,850 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 380 transitions. [2018-11-12 20:43:33,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-11-12 20:43:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 380 transitions. [2018-11-12 20:43:33,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-11-12 20:43:33,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:33,852 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:33,852 INFO L423 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:33,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:33,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2135435927, now seen corresponding path program 72 times [2018-11-12 20:43:33,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:33,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:33,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:33,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:33,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6626 backedges. 1477 proven. 2734 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-11-12 20:43:34,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:34,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:34,873 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:34,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:34,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:34,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:34,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:34,881 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:34,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:34,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:34,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6626 backedges. 1478 proven. 2628 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-12 20:43:35,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6626 backedges. 1478 proven. 2628 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-11-12 20:43:36,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:36,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 45 [2018-11-12 20:43:36,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:36,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:43:36,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:43:36,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=792, Invalid=1188, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:43:36,370 INFO L87 Difference]: Start difference. First operand 379 states and 380 transitions. Second operand 45 states. [2018-11-12 20:43:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:36,872 INFO L93 Difference]: Finished difference Result 389 states and 390 transitions. [2018-11-12 20:43:36,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 20:43:36,873 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 376 [2018-11-12 20:43:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:36,875 INFO L225 Difference]: With dead ends: 389 [2018-11-12 20:43:36,875 INFO L226 Difference]: Without dead ends: 387 [2018-11-12 20:43:36,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 714 SyntacticMatches, 75 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1669 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=805, Invalid=1357, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:43:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-12 20:43:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-11-12 20:43:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-11-12 20:43:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 388 transitions. [2018-11-12 20:43:36,887 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 388 transitions. Word has length 376 [2018-11-12 20:43:36,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:36,888 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 388 transitions. [2018-11-12 20:43:36,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:43:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 388 transitions. [2018-11-12 20:43:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-11-12 20:43:36,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:36,890 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:36,890 INFO L423 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:36,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:36,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1357713805, now seen corresponding path program 73 times [2018-11-12 20:43:36,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:36,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:36,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:36,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:36,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6919 backedges. 2849 proven. 1406 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-12 20:43:38,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:38,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:38,826 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:38,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:38,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:38,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:38,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:38,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:43:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:38,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6919 backedges. 2849 proven. 1406 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-12 20:43:41,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6919 backedges. 2849 proven. 1406 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-12 20:43:43,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:43,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 117 [2018-11-12 20:43:43,434 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:43,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-11-12 20:43:43,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-11-12 20:43:43,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3119, Invalid=10453, Unknown=0, NotChecked=0, Total=13572 [2018-11-12 20:43:43,436 INFO L87 Difference]: Start difference. First operand 387 states and 388 transitions. Second operand 117 states. [2018-11-12 20:43:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:46,564 INFO L93 Difference]: Finished difference Result 550 states and 589 transitions. [2018-11-12 20:43:46,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-11-12 20:43:46,564 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 384 [2018-11-12 20:43:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:46,566 INFO L225 Difference]: With dead ends: 550 [2018-11-12 20:43:46,566 INFO L226 Difference]: Without dead ends: 389 [2018-11-12 20:43:46,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 655 SyntacticMatches, 76 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9955 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5498, Invalid=18682, Unknown=0, NotChecked=0, Total=24180 [2018-11-12 20:43:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-11-12 20:43:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-11-12 20:43:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-11-12 20:43:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-11-12 20:43:46,609 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 384 [2018-11-12 20:43:46,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:46,610 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-11-12 20:43:46,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-11-12 20:43:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-11-12 20:43:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-11-12 20:43:46,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:46,612 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:46,612 INFO L423 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:46,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:46,612 INFO L82 PathProgramCache]: Analyzing trace with hash 307849415, now seen corresponding path program 74 times [2018-11-12 20:43:46,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:46,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:43:46,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:46,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 1555 proven. 2884 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-11-12 20:43:47,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:47,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:47,388 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:47,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:47,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:47,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:47,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:43:47,398 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:43:47,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-12 20:43:47,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:47,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 1556 proven. 2775 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-12 20:43:47,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:43:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6995 backedges. 1556 proven. 2775 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2018-11-12 20:43:49,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:43:49,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 46 [2018-11-12 20:43:49,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:43:49,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-12 20:43:49,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-12 20:43:49,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=832, Invalid=1238, Unknown=0, NotChecked=0, Total=2070 [2018-11-12 20:43:49,006 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 46 states. [2018-11-12 20:43:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:43:49,611 INFO L93 Difference]: Finished difference Result 399 states and 400 transitions. [2018-11-12 20:43:49,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-12 20:43:49,611 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 386 [2018-11-12 20:43:49,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:43:49,614 INFO L225 Difference]: With dead ends: 399 [2018-11-12 20:43:49,614 INFO L226 Difference]: Without dead ends: 397 [2018-11-12 20:43:49,615 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 733 SyntacticMatches, 77 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=845, Invalid=1411, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:43:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-11-12 20:43:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-11-12 20:43:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-11-12 20:43:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2018-11-12 20:43:49,628 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 386 [2018-11-12 20:43:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:43:49,628 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2018-11-12 20:43:49,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-12 20:43:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2018-11-12 20:43:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-11-12 20:43:49,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:43:49,630 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:43:49,630 INFO L423 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:43:49,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:43:49,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1852597995, now seen corresponding path program 75 times [2018-11-12 20:43:49,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:43:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:49,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:43:49,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:43:49,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:43:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:43:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7296 backedges. 3002 proven. 1482 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2018-11-12 20:43:51,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:51,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:43:51,968 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:43:51,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:43:51,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:43:51,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:51,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:43:51,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:43:52,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:43:52,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:43:52,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:43:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7296 backedges. 3002 proven. 1482 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2018-11-12 20:43:54,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-12 20:43:56,781 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-12 20:43:56,981 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:43:56,982 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:43:56,987 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:43:56,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:43:56 BoogieIcfgContainer [2018-11-12 20:43:56,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:43:56,988 INFO L168 Benchmark]: Toolchain (without parser) took 233215.23 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -963.7 MB). Peak memory consumption was 160.3 MB. Max. memory is 7.1 GB. [2018-11-12 20:43:56,989 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:43:56,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:43:56,990 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:43:56,990 INFO L168 Benchmark]: Boogie Preprocessor took 22.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:43:56,991 INFO L168 Benchmark]: RCFGBuilder took 398.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-12 20:43:56,991 INFO L168 Benchmark]: TraceAbstraction took 232456.12 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 366.5 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -176.4 MB). Peak memory consumption was 190.1 MB. Max. memory is 7.1 GB. [2018-11-12 20:43:56,994 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 311.24 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 18.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 398.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 232456.12 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 366.5 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -176.4 MB). Peak memory consumption was 190.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 395 with TraceHistMax 39,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 120 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. TIMEOUT Result, 232.3s OverallTime, 78 OverallIterations, 39 TraceHistogramMax, 66.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3905 SDtfs, 3029 SDslu, 44274 SDs, 0 SdLazy, 53683 SolverSat, 3654 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34463 GetRequests, 27386 SyntacticMatches, 2997 SemanticMatches, 4080 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155218 ImplicationChecksByTransitivity, 154.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 77 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 145.3s InterpolantComputationTime, 30383 NumberOfCodeBlocks, 30383 NumberOfCodeBlocksAsserted, 669 NumberOfCheckSat, 45328 ConstructedInterpolants, 0 QuantifiedInterpolants, 31881352 SizeOfPredicates, 222 NumberOfNonLiveVariables, 32190 ConjunctsInSsa, 3256 ConjunctsInUnsatCore, 225 InterpolantComputations, 3 PerfectInterpolantSequences, 375700/540128 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown